The decision problem for the probabilities of higher-order properties
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
An Improved Exponential-Time Algorithm for k-SAT
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A Duality between Clause Width and Clause Density for SAT
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Algorithms and resource requirements for fundamental problems
Algorithms and resource requirements for fundamental problems
k-SAT Is No Harder Than Decision-Unique-k-SAT
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
The Complexity of Satisfiability of Small Depth Circuits
Parameterized and Exact Computation
The time complexity of constraint satisfaction
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
On the complexity of circuit satisfiability
Proceedings of the forty-second ACM symposium on Theory of computing
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Finding efficient circuits for ensemble computation
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
Can sat be solved in “moderately exponential” time, i.e., in time p(|F|) 2cn for some polynomial p and some constant cF is a CNF formula of size |F| over n variables? This challenging question is far from being resolved. In this paper, we relate the question of moderately exponential complexity of sat to the question of moderately exponential complexity of problems defined by existential second-order sentences. Namely, we extend the class SNP (Strict NP) that consists of Boolean queries defined by existential second-order sentences where the first-order part has a universal prefix. The extension is obtained by allowing a ∀...∀∃...∃ prefix in the first-order part. We prove that if sat can be solved in moderately exponential time then all problems in the extended class can also be solved in moderately exponential time.