610 search results - page 72 / 122 » Using SAT in QBF |
COCO
2008
Springer
13 years 10 months ago
2008
Springer
![Amplifying ZPP^SAT[1] and the Two Queries Problem](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Amplifying ZPP^SAT[1] and the Two Queries Problem")
This paper shows a complete upward collapse in the Polynomial Hierarchy (PH) if for ZPP, two queries to a SAT oracle is equivalent to one query. That is, ZPPSAT[1] = ZPPSAT [2] = ...
CP
2008
Springer
13 years 10 months ago
2008
Springer
Experimentation of new algorithms is the usual companion section of papers dealing with SAT. However, the behavior of those algorithms is so unpredictable that even strong experime...
SODA
2001
ACM
13 years 10 months ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
SODA
1998
ACM
13 years 10 months ago
1998
ACM
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
CONSTRAINTS
2007
13 years 9 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...