Results 301 to 310 of about 734,348 (361)
Some of the next articles are maybe not open access.
, 2016
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 ...
B. Schröder
semanticscholar +2 more sources
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 ...
B. Schröder
semanticscholar +2 more sources
Upper and lower bounds to eigenvalues
Theoretica Chimica Acta, 1969R. P. Messmer, Fraser W. Birss
semanticscholar +4 more sources
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
Subexponential Upper and Lower Bounds in Wasserstein Distance for Markov Processes
Applied Mathematics and Optimization, 2019In this article, relying on Foster–Lyapunov drift conditions, we establish subexponential upper and lower bounds on the rate of convergence in the Lp\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{
Nikola Sandri'c +2 more
semanticscholar +1 more source
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing, 1994Summary: 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 ...
Martin Dietzfelbinger +5 more
semanticscholar +2 more sources
Upper and Lower Bounds on the Power of Advice
SIAM Journal on Computing, 2016Summary: Proving superpolylogarithmic lower bounds for dynamic data structures has remained an open problem despite years of research. Pǎtraşcu proposed an exciting approach for breaking this barrier via a two-player communication model in which one player gets private advice at the beginning of the protocol.
Chattopadhyay, Arkadev +3 more
openaire +1 more source
Upper and Lower Bounds for Selection on the Mesh
Algorithmica, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Condon, A., Narayanan, L.
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
Upper and Lower Bounds for Stochastic Processes
Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge / A Series of Modern Surveys in Mathematics, 2021M. Talagrand
semanticscholar +1 more source
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