Results 1 to 10 of about 2,566,965 (290)
Upper Tail Bounds for Stars [PDF]
The Electronic Journal of Combinatorics, 2020 For $r \ge 2$, let $X$ be the number of $r$-armed stars $K_{1,r}$ in the binomial random graph $G_{n,p}$. We study the upper tail ${\mathbb P}(X \ge (1+\epsilon){\mathbb E} X)$, and establish exponential bounds which are best possible up to constant factors in the exponent (for the special case of stars $K_{1,r}$ this solves a problem of Janson and ...
Matas Sileikis, Lutz Warnke
openaire +4 more sources
An Improved Upper Bound for SAT
Proceedings of the AAAI Conference on Artificial Intelligence, 2021 We show that the CNF satisfiability problem can be solved O^*(1.2226^m) time, where m is the number of clauses in the formula, improving the known upper bounds O^*(1.234^m) given by Yamamoto 15 years ago and O^*(1.239^m) given by Hirsch 22 years ago.
Huairui Chu, Mingyu Xiao 0001, Zhe Zhang
openaire +4 more sources
Thrackles: An Improved Upper Bound [PDF]
Discrete Applied Mathematics, 2018 A {\em thrackle} is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle of $n$ vertices has at most $1.3984n$ edges. {\em Quasi-thrackles} are defined similarly, except that every pair of edges that do not share a vertex are allowed to cross an {\
Radoslav Fulek, János Pach
openaire +9 more sources
Upper Bound Approximation for BlockMaxWand [PDF]
Proceedings of the ACM SIGIR International Conference on Theory of Information Retrieval, 2017 BlockMaxWand is a recent advance on the Wand dynamic pruning technique, which allows efficient retrieval without any e.ectiveness degradation to rank K. However, while BMW uses docid-sorted indices, it relies on recording the upper bound of the term weighting model scores for each block of postings in the inverted index.
Craig Macdonald, Nicola Tonellotto
openaire +2 more sources
Lower Bounds and Upper Bounds for MaxSAT [PDF]
, 2012 This paper presents several ways to compute lower and upperbounds for MaxSAT based on calling a complete SAT solver. Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the search of MaxSAT solvers on some benchmarks, and (iii) the upper bounds computed by a Stochastic Local Search procedure (SLS) can be ...
Federico Heras +2 more
openaire +2 more sources
On the Monotone Upper Bound Problem [PDF]
Experimental Mathematics, 2004 The Monotone Upper Bound Problem asks for the maximal number M(d,n) of vertices on a strictly-increasing edge-path on a simple d-polytope with n facets. More specifically, it asks whether the upper bound M(d,n)<=M_{ubt}(d,n) provided by McMullen's (1970) Upper Bound Theorem is tight, where M_{ubt}(d,n) is the number of vertices of a dual-to-cyclic d-
Pfeifle, Julián, Ziegler, Günter M.
openaire +5 more sources
An Upper Bound in Goldbach's Problem [PDF]
Mathematics of Computation, 1993 It is clear that the number of distinct representations of a number n as the sum of two primes is at most the number of primes in the interval [
Deshouillers, Jean-Marc +3 more
openaire +2 more sources
Physical Review Letters, 2017 The linear growth of operators in local quantum systems leads to an effective light cone even if the system is nonrelativistic. We show that the consistency of diffusive transport with this light cone places an upper bound on the diffusivity: D≲v^{2}τ_{eq}.
Thomas, Hartman +2 more
openaire +3 more sources
Improved upper bounds on shellsort
Journal of Computer and System Sciences, 1983 The running time of Shellsort, with the number of passes restricted to O(log N), was thought for some time to be \(\Theta (N^{3/2})\), due to general results of Pratt. Sedgewick recently gave an \(O(N^{4/3})\) bound, but extensions of his method to provide better bounds seem to require new results on a classical problem in number theory. In this paper,
Incerpi, Janet, Sedgewick, Robert
openaire +5 more sources