Results 11 to 20 of about 101,766 (164)
Raising NP lower bounds to parallel NP lower bounds [PDF]
ACM SIGACT News, 1997 This issue's column surveys recent progress in raising NP-hardness lower bounds to parallel NP lower bounds. Complexity theorists will learn that Lewis Carroll (unbeknownst to himself) was a fellow complexity theorist. So that readers specializing in algorithms don't feel left out, let me mention that they are in even better company.
Edith Hemaspaandra +2 more
openaire +4 more sources
A Lower Jackson Bound on (- ∞, ∞) [PDF]
Proceedings of the American Mathematical Society, 1970 We produce a lower bound for the degree of uniform polynomial approximation to continuous functions on the whole real line using the weight function exp
J. S. Byrnes, D. J. Newman
openaire +1 more source
Discrete Analysis, 2023 New lower bounds for cap sets, Discrete Analysis 2023:20, 18 pp. One of the best known problems in additive combinatorics, the cap set problem, asks how large a subset of $\mathbb F_3^n$ can be if it contains no non-trivial solutions to the equation $x ...
Fred Tyrrell
doaj +1 more source
Lower Bounds for QBFs of Bounded Treewidth [PDF]
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020 The problem of deciding the validity (QSAT) of quantified Boolean formulas (QBF) is a vivid research area in both theory and practice. In the field of parameterized algorithmics, the well-studied graph measure treewidth turned out to be a successful parameter.
Johannes Klaus Fichte +2 more
openaire +3 more sources
Almost Periodic Solutions of First-Order Ordinary Differential Equations
Mathematics, 2018 Approaches to estimate the number of almost periodic solutions of ordinary differential equations are considered. Conditions that allow determination for both upper and lower bounds for these solutions are found.
Seifedine Kadry +3 more
doaj +1 more source
Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317), 2001 The main result of the paper is that primality testing, gcd computation and square-free computation is not in \(AC^0\), that is, can not be accomplished by constant depth, polynomial-size circuits of AND, OR and NOT gates. The technique used by the authors is to reduce the functions that have circuit lower bound known to divisibility and then, using a ...
Eric Allender +2 more
openaire +5 more sources
Solving the Distributed Permutation Flow-Shop Scheduling Problem Using Constrained Programming
Applied Sciences, 2023 The permutation flow-shop scheduling problem is a classical problem in scheduling that aims at identifying the optimal sequence of jobs that should be processed in a number of machines in an effort to minimize makespan or some other performance criterion.
Christos Gogos
doaj +1 more source
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
Contraction and Treewidth Lower Bounds
Journal of Graph Algorithms and Applications, 2006 Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all subgraphs of the minimum degree.
Hans Bodlaender +2 more
doaj +1 more source