Results 261 to 270 of about 156,468 (326)
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
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 +5 more sources
Statistical verification of upper and lower bounds for the security performance of wiretap channels
IEEE Wireless Communications and Networking Conference, 2023In this paper we show a way to check semantic security for AWGN wiretap channels. We introduce low complexity decoding methods that provide upper and lower bounds to the performance of an attack strategy that closely resembles the best attack strategy ...
Johannes Voichtleitner +3 more
semanticscholar +1 more source
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
Some new upper and lower bounds for the Mills ratio
Journal of Mathematical Analysis and Applications, 2020In this paper, we present new upper and lower bounds for the Mills ratio of the standard Gaussian law. Several different methods are used to derive these new bounds.
S. From
semanticscholar +1 more source
Upper and Lower Bounds for Selection on the Mesh
Algorithmica, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anne Condon, Lata Narayanan
openaire +3 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.
Arkadev Chattopadhyay +3 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