Coping with the NP-Hardness of the Graph Bandwidth Problem
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
An algorithm for the satisfiability problem of formulas in conjunctive normal form
Journal of Algorithms
Generalized above guarantee vertex cover and r-partization
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
NE is not NP turing reducible to nonexponentially dense NP sets
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Some remarks on the incompressibility of width-parameterized SAT instances
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Parameterized average-case complexity of the hypervolume indicator
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Speeding up many-objective optimization by Monte Carlo approximations
Artificial Intelligence
Black-box obfuscation for d-CNFs
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
The problem of k-SAT is to determine if the given k-CNF has a satisfying solution. It is a celebrated open question as to whether it requires exponential time to solve k-SAT for k \geq 3.Define s_k (for k\geq 3) to be the infimum of \{\delta: \mbox{there exists an O(2^{\delta n})} \mbox{ algorithm for solving k-SAT} \}. Define {\bf ETH} (Exponential-Time Hypothesis) for k-SAT as follows: for k\geq 3, s_k 0. In other words, for k \geq 3, k-SAT does not have a subexponential-time algorithm.In this paper, we show that s_k is an increasing sequence assuming \eth\ for k-SAT. Let s_\infty be the limit of s_k. We will in fact show that s_k \leq (1-d/(ek))s_\infty for some constant d 0.