Results 121 to 130 of about 58,381 (161)
Some of the next articles are maybe not open access.
Upper and Lower Bounds of Table Sums
Algebra Colloquium, 2021For a group [Formula: see text], we produce upper and lower bounds for the sum of the entries of the Brauer character table of [Formula: see text] and the projective indecomposable character table of [Formula: see text]. When [Formula: see text] is a [Formula: see text]-separable group, we show that the sum of the entries in the table of Isaacs ...
Chen, Xiaoyou +2 more
openaire +1 more source
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing, 1988Summary: The dynamic dictionary problem is considered: provide an algorithm for storing a dynamic set, allowing the operations insert, delete, and lookup. A dynamic perfect hashing strategy is given: a randomized algorithm for the dynamic dictionary problem that takes \(O(1)\) worst-case time for lookups and \(O(1)\) amortized expected time for ...
Dietzfelbinger, M. +5 more
openaire +3 more sources
Improved upper and lower bounds fork-broadcasting
Networks, 2001Summary: We continue the investigation of \(k\)-broadcasting, a variant of broadcasting in which an informed vertex can call up to \(k\) of its neighbors in each time unit. A focus of the investigation into broadcasting is the function \(B_k(n)\), which is the minimum number of edges in any \(n\) vertex graph such that each vertex can originate a \(k\)-
Harutyunyan, Hovhannes A. +1 more
openaire +2 more sources
Gate elimination: Circuit size lower bounds and #SAT upper bounds
Theoretical Computer Science, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Golovnev, Alexander +3 more
openaire +2 more sources
Lower and upper bounds for stokes eigenvalues
CalcolozbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yue, Yifan, Chen, Hongtao, Zhang, Shuo
openaire +1 more source
2003
Upper and lower bounds have already been defined in Definitions 2.1.4 and 2.3.1. From their use in Zorn’s Lemma, as well as their occurrences in the proofs of Dilworth’s Chain-Decomposition Theorem 2.5.7 and Proposition 2.6.7 (in both proofs, sets were defined in terms of their upper bounds), the reader can already infer that bounds of sets play an ...
openaire +1 more source
Upper and lower bounds have already been defined in Definitions 2.1.4 and 2.3.1. From their use in Zorn’s Lemma, as well as their occurrences in the proofs of Dilworth’s Chain-Decomposition Theorem 2.5.7 and Proposition 2.6.7 (in both proofs, sets were defined in terms of their upper bounds), the reader can already infer that bounds of sets play an ...
openaire +1 more source