Sciweavers

2095 search results - page 28 / 419
» Improved pebbling bounds
Sort
View
FOCS
2010
IEEE
14 years 12 months ago
Improved Bounds for Geometric Permutations
Natan Rubin, Haim Kaplan, Micha Sharir
110
Voted
STACS
2009
Springer
15 years 8 months ago
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
Kenya Ueno
ERSHOV
2003
Springer
15 years 7 months ago
Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
Henrik Björklund, Sven Sandberg, Sergei G. Vo...
123
Voted
JSC
2010
103views more  JSC 2010»
15 years 9 days ago
Bounds on absolute positiveness of multivariate polynomials
We propose a general framework for obtaining bounds on absolute positiveness of multivariate polynomials. We show that a known bound by Hong is a nearly optimal bound within this ...
Prashant Batra, Vikram Sharma