28 search results - page 2 / 6 » On Moderately Exponential Time for SAT |
CP
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
NC
2011
13 years 5 days ago
2011
We consider recognizer P systems having three polarizations associated to the membranes, and we show that they are able to solve the PSPACEcomplete problem Quantified 3SAT when wo...
ICCAD
2001
IEEE
14 years 2 months ago
2001
IEEE
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
CP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
AMAI
2005
Springer
13 years 5 months ago
2005
Springer
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...