123 search results - page 16 / 25 » Complexity of Boolean Functions on PRAMs - Lower Bound Techn... |
ICCAD
1999
IEEE
13 years 11 months ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
EOR
2008
13 years 7 months ago
2008
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
SAT
2010
Springer
13 years 5 months ago
2010
Springer
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— We prove that the number of Pareto-optimal solutions in any multiobjective binary optimization problem with a finite number of linear objective functions is polynomial...