Results 1 to 10 of about 996,357 (278)
Lower bounds on Herbrand’s theorem [PDF]
Proceedings of the American Mathematical Society, 1979 We give non Kalmar-elementary lower bounds on the elimination of quantifier inferences via Herbrand’s theorem.
openaire +1 more source
Radio Network Lower Bounds Made Easy
, 2014 Theoreticians have studied distributed algorithms in the radio network model for close to three decades. A significant fraction of this work focuses on lower bounds for basic communication problems such as wake-up (symmetry breaking among an unknown set ...
Newport, Calvin
core +1 more source
Lower bounds for representation growth [PDF]
Journal of Group Theory, 2010 18 ...
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 ...
Heras, Federico +2 more
openaire +2 more sources
On Lower Bounds for Statistical Learning Theory
Entropy, 2017 In recent years, tools from information theory have played an increasingly prevalent role in statistical machine learning. In addition to developing efficient, computationally feasible algorithms for analyzing complex datasets, it is of theoretical ...
Po-Ling Loh
doaj +1 more source
Lower Bounds for the Graph Homomorphism Problem
, 2015 The graph homomorphism problem (HOM) asks whether the vertices of a given $n$-vertex graph $G$ can be mapped to the vertices of a given $h$-vertex graph $H$ such that each edge of $G$ is mapped to an edge of $H$.
A Björklund +19 more
core +1 more source
Lower bounds for Buchsbaum* complexes
European Journal of Combinatorics, 2011 The class of $(d-1)$-dimensional Buchsbaum* simplicial complexes is studied. It is shown that the rank-selected subcomplexes of a (completely) balanced Buchsbaum* simplicial complex are also Buchsbaum*. Using this result, lower bounds on the $h$-numbers of balanced Buchsbaum* simplicial complexes are established. In addition, sharp lower bounds on the $
Browder, Jonathan, Klee, Steven
openaire +3 more sources
Tighter lower bounds on quantum annealing times
SciPost PhysicsWe derive lower bounds on the time needed for a quantum annealer to prepare the ground state of a target Hamiltonian. These bounds do not depend on the annealing schedule and can take the local structure of the Hamiltonian into account. Consequently, the
Luis Pedro García-Pintos, Mrunmay Sahasrabudhe, Christian Arenz
doaj +1 more source
We propose two axioms that introduce lower bounds into resource monotonicity requirements for rules for the problem of adjudicating conflicting claims. Suppose the amount to divide increases.
LUTTENS, Roland Iwan
core
Proportions of r-regular elements in finite classical groups
, 2012 For a prime $r$, we obtain lower bounds on the proportion of $r$-regular elements in classical groups and show that these lower bounds are the best possible lower bounds that do not depend on the order of the defining field.
Babai, Laszlo +3 more
core +2 more sources