Results 11 to 20 of about 1,085,519 (269)
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 +2 more sources
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 +2 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
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
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 +3 more sources
A Lower Bound for the Volatility Swap in the Lognormal SABR Model
Axioms, 2023 In the short time to maturity limit, it is proved that for the conditionally lognormal SABR model the zero vanna implied volatility is a lower bound for the volatility swap strike.
Elisa Alòs +2 more
doaj +1 more source
Cramér-Rao Lower Bound for Fuzzy-Valued Random Variables
Austrian Journal of Statistics, 2016 In some point estimation problems, we may confront imprecise (fuzzy) concepts. One important case is a situation where all observations are fuzzy rather than crisp.
Hamzeh Torabi
doaj +1 more source
Mathematics, 2023 In this paper, the authors review and survey some results published since 2020 about (complete) monotonicity, inequalities, and their necessary and sufficient conditions for several newly introduced functions involving polygamma functions and originating
Feng Qi, Ravi Prakash Agarwal
doaj +1 more source
Lower Bound for the First Steklov Eigenvalue
Revista de Ciencias, 2014 In this paper we find lower bounds for the first Steklov eigenvalue in Riemannian n-manifolds, n = 2, 3, with non-positive sectional curvature.
Óscar Andrés Montaño
doaj +1 more source