Dynamic Programming Treatment of the Travelling Salesman Problem
Journal of the ACM (JACM)
Algorithms for quantified Boolean formulas
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Improved upper bounds for 3-SAT
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An improved exponential-time algorithm for k-SAT
Journal of the ACM (JACM)
Inclusion--Exclusion Algorithms for Counting Set Partitions
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Fourier meets möbius: fast subset convolution
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
New upper bound for the #3-SAT problem
Information Processing Letters
The Travelling Salesman Problem in Bounded Degree Graphs
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
SIAM Journal on Computing
Solving satisfiability in less than 2n steps
Discrete Applied Mathematics
The exponential complexity of satisfiability problems
The exponential complexity of satisfiability problems
On the boolean connectivity problem for horn relations
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Algorithmics in exponential time
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
We present an exact algorithm for a PSPACE-complete problem, denoted by CONNkSAT, which asks if the solution space for a given k-CNF formula is connected on the n-dimensional hypercube. The problem is known to be PSPACE-complete for k≥3, and polynomial solvable for k≤2 [6]. We show that CONN kSAT for k≥3 is solvable in time $O((2-\epsilon_k)^n)$ for some constant εk0, where εk depends only on k, but not on n. This result is considered to be interesting due to the following fact shown by [5]: QBF-3-SAT, which is a typical PSPACE-complete problem, is not solvable in time O((2−ε)n) for any constant ε0, provided that the SAT problem (with no restriction to the clause length) is not solvable in time O((2−ε)n) for any constant ε0.