Exponential time hypothesis
In computational complexity theory, the exponential time hypothesis is an unproven computational hardness assumption that was formulated by Impagliazzo & Paturi (1999). The hypothesis states that 3-SAT (or any of several, but not all, NP-complete problems) cannot be solved in subexponential time in the worst case. The exponential time hypothesis, if true, would imply that P ≠ NP, but it is a stronger statement. It can be used to show that many computational problems are equivalent in complexity, in the sense that if one of them has a subexponential time algorithm then they all do.
k-SAT is the problem of testing whether a Boolean expression, in conjunctive normal form with at most k variables per clause, can be made to be true by some assignment of Boolean values to its variables. For each integer k ≥ 2, define a real number sk to be the infimum of the real numbers δ for which k-SAT can be algorithmically solved in time O(2δn), where n is the number of variables in the given k-SAT instance. Then s2 = 0, because 2-SAT can be solved in polynomial time. Moreover, s3 ≤ s4 ≤ ..., since the difficulty does not decrease with growing k.
The exponential time hypothesis is the conjecture that sk > 0 for every k > 2, or, equivalently, that s3 > 0.
Some sources define the exponential time hypothesis to be the slightly weaker statement that 3-SAT cannot be solved in time 2o(n). If there existed an algorithm to solve 3-SAT in time 2o(n), then s3 would equal zero. However, it is consistent with current knowledge that there could be a sequence of 3-SAT algorithms, each with running time O(2δin) for a sequence of numbers δi tending towards zero, but where the descriptions of these algorithms are so quickly growing that a single algorithm could not automatically select and run the most appropriate one.
Another variant is the non-uniform exponential time hypothesis, a strengthening of the second phrasing of the ETH, which posits that there is no family of algorithms (one for each length of the input, in the spirit of advice) that can solve 3-SAT in time 2o(n).
Implications for satisfiability
It is not possible for sk to equal s∞ for any finite k: as Impagliazzo, Paturi & Zane (2001) showed, there exists a constant α such that sk ≤ s∞(1 − α/k). Therefore, if the exponential time hypothesis is true, there must be infinitely many values of k for which sk differs from sk + 1.
An important tool in this area is the sparsification lemma of Impagliazzo, Paturi & Zane (2001), which shows that, for any ε > 0, any k-CNF formula can be replaced by O(2εn) simpler k-CNF formulas in which each variable appears only a constant number of times, and therefore in which the number of clauses is linear. The sparsification lemma is proven by repeatedly finding large sets of clauses that have a nonempty common intersection in a given formula, and replacing the formula by two simpler formulas, one of which has each of these clauses replaced by their common intersection and the other of which has the intersection removed from each clause. By applying the sparsification lemma and then using new variables to split the clauses, one may then obtain a set of O(2εn) 3-CNF formulas, each with a linear number of variables, such that the original k-CNF formula is satisfiable if and only if at least one of these 3-CNF formulas is satisfiable. Therefore, if 3-SAT could be solved in subexponential time, one could use this reduction to solve k-SAT in subexponential time as well. Equivalently, if sk > 0 for any k > 3, then s3 > 0 as well, and the exponential time hypothesis would be true.
The limiting value s∞ of the sequence of numbers sk is at most equal to sCNF, where sCNF is the infimum of the numbers δ such that satisfiability of conjunctive normal form formulas without clause length limits can be solved in time O(2δn). Therefore, if the strong exponential time hypothesis is true, then there would be no algorithm for general CNF satisfiability that is significantly faster than testing all possible truth assignments. However, if the strong exponential time hypothesis fails, it would still be possible for sCNF to equal one.
Implications for other search problems
The exponential time hypothesis implies that many other problems in the complexity class SNP do not have algorithms whose running time is faster than cn for some constant c. These problems include graph k-colorability, finding Hamiltonian cycles, maximum cliques, maximum independent sets, and vertex cover on n-vertex graphs. Conversely, if any of these problems has a subexponential algorithm, then the exponential time hypothesis could be shown to be false.
If cliques or independent sets of logarithmic size could be found in polynomial time, the exponential time hypothesis would be false. Therefore, even though finding cliques or independent sets of such small size is unlikely to be NP-complete, the exponential time hypothesis implies that these problems are non-polynomial. More generally, the exponential time hypothesis implies that it is not possible to find cliques or independent sets of size k in time no(k). The exponential time hypothesis also implies that it is not possible to solve the k-SUM problem (given n real numbers, find k of them that add to zero) in time no(k). The strong exponential time hypothesis implies that it is not possible to find k-vertex dominating sets more quickly than in time nk − o(1).
The exponential time hypothesis implies also that the weighted Feedback Arc Set Tournament (FAST) problem does not have a parametrized algorithm with running time O*(2o(√)), it does have though a parametrized algorithm with running time O*(2O(√)).
The strong exponential time hypothesis leads to tight bounds on the parameterized complexity of several graph problems on graphs of bounded treewidth. In particular, if the strong exponential time hypothesis is true, then the optimal time bound for finding independent sets on graphs of treewidth w is (2 − o(1))wnO(1), the optimal time for the dominating set problem is (3 − o(1))wnO(1), the optimum time for maximum cut is (2 − o(1))wnO(1), and the optimum time for k-coloring is (k − o(1))wnO(1). Equivalently, any improvement on these running times would falsify the strong exponential time hypothesis. The exponential time hypothesis also implies that any fixed-parameter tractable algorithm for edge clique cover must have double exponential dependence on the parameter.
Implications in communication complexity
In the three-party set disjointness problem in communication complexity, three subsets of the integers in some range [1,m] are specified, and three communicating parties each know two of the three subsets. The goal is for the parties to transmit as few bits to each other on a shared communications channel in order for one of the parties to be able to determine whether the intersection of the three sets is empty or nonempty. A trivial m-bit communications protocol would be for one of the three parties to transmit a bitvector describing the intersection of the two sets known to that party, after which either of the two remaining parties can determine the emptiness of the intersection. However, if there exists a protocol that solves the problem with o(m) communication and 2o(m) computation, it could be transformed into an algorithm for solving k-SAT in time O(1.74n) for any fixed constant k, violating the strong exponential time hypothesis. Therefore, the strong exponential time hypothesis implies either that the trivial protocol for three-party set disjointness is optimal, or that any better protocol requires an exponential amount of computation.
Implications in structural complexity
If the exponential time hypothesis is true, then 3-SAT would not have a polynomial time algorithm, and therefore it would follow that P ≠ NP. More strongly, in this case, 3-SAT could not even have a quasi-polynomial time algorithm, so NP could not be a subset of QP. However, if the exponential time hypothesis fails, it would have no implication for the P versus NP problem. There exist NP-complete problems for which the best known running times have the form O(2nc) for c < 1, and if the best possible running time for 3-SAT were of this form, then P would be unequal to NP (because 3-SAT is NP-complete and this time bound is not polynomial) but the exponential time hypothesis would be false.
In parameterized complexity theory, because the exponential time hypothesis implies that there does not exist a fixed-parameter-tractable algorithm for maximum clique, it also implies that W ≠ FPT. It is an important open problem in this area whether this implication can be reversed: does W ≠ FPT imply the exponential time hypothesis? There is a hierarchy of parameterized complexity classes called the M-hierarchy that interleaves the W-hierarchy in the sense that, for all i, M[i] ⊆ W[i] ⊆ M[i + 1]; for instance, the problem of finding a vertex cover of size k log n in an n-vertex graph with parameter k is complete for M. The exponential time hypothesis is equivalent to the statement that M ≠ FPT, and the question of whether M[i] = W[i] for i > 1 is also open.
It is also possible to prove implications in the other direction, from the failure of a variation of the strong exponential time hypothesis to separations of complexity classes. As Williams (2010) shows, if there exists an algorithm A that solves Boolean circuit satisfiability in time 2n/ƒ(n) for some superpolynomially growing function ƒ, then NEXPTIME is not a subset of P/poly. Williams shows that, if algorithm A exists, and a family of circuits simulating NEXPTIME in P/poly also existed, then algorithm A could be composed with the circuits to simulate NEXPTIME problems nondeterministically in a smaller amount of time, violating the time hierarchy theorem. Therefore, the existence of algorithm A proves the nonexistence of the family of circuits and the separation of these two complexity classes.
- For example, the Maximum independent set problem for planar graphs is NP-complete, but can be solved in subexponential time. When a 3-SAT instance of size n is reduced to a planar MIS problem, the latter's size grows to an order of Θ(n2), so an exponential lower bound for 3-SAT translates into a lower bound that is subexponential in the expanded instance size.
- Woeginger (2003).
- Flum & Grohe (2006).
- Calabro, Impagliazzo & Paturi (2009).
- Impagliazzo, Paturi & Zane (2001).
- Pătraşcu & Williams (2010).
- Feige & Kilian (1997).
- Chen et al. (2006).
- Karpinski & Schudy (2010)
- Cygan et al. (2015)
- Lokshtanov, Marx & Saurabh (2011).
- Cygan, Pilipczuk & Pilipczuk (2013).
- Calabro, Chris; Impagliazzo, Russel; Paturi, Ramamohan (2009), "The Complexity of Satisfiability of Small Depth Circuits", Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, pp. 75–85.
- Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge (2006), "Strong computational lower bounds via parameterized complexity", Journal of Computer and System Sciences, 72 (8): 1346–1367, doi:10.1016/j.jcss.2006.04.007.
- Cygan, Marek; Fomin, Fedor V.; Kowalik, Lukasz; Lokshtanov, Daniel; Marx, Daniel; Pilipczuk, Marcin; Pilipczuk, Michal; Saurabh, Saket (2015), Parameterized Algorithms, Springer, p. 555, ISBN 978-3-319-21274-6
- Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał (2013), "Known algorithms for EDGE CLIQUE COVER are probably optimal", Proc. 24th ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), arXiv:1203.1754, Bibcode:2012arXiv1203.1754C, archived from the original on 2013-04-16.
- Dantsin, Evgeny; Wolpert, Alexander (2010), "On moderately exponential time for SAT", Theory and Applications of Satisfiability Testing–SAT 2010, Lecture Notes in Computer Science, 6175, Springer-Verlag, pp. 313–325, doi:10.1007/978-3-642-14186-7_27, ISBN 978-3-642-14185-0.
- Feige, Uriel; Kilian, Joe (1997), "On limited versus polynomial nondeterminism", Chicago Journal of Theoretical Computer Science, 1: 1–20, doi:10.4086/cjtcs.1997.001.
- Flum, Jörg; Grohe, Martin (2006), "16. Subexponential Fixed-Parameter Tractability", Parameterized Complexity Theory, EATCS Texts in Theoretical Computer Science, Springer-Verlag, pp. 417–451, ISBN 978-3-540-29952-3.
- Impagliazzo, Russell; Paturi, Ramamohan (1999), "The Complexity of k-SAT", Proc. 14th IEEE Conf. on Computational Complexity, pp. 237–240, doi:10.1109/CCC.1999.766282, ISBN 978-0-7695-0075-1.
- Impagliazzo, Russell; Paturi, Ramamohan; Zane, Francis (2001), "Which problems have strongly exponential complexity?", Journal of Computer and System Sciences, 63 (4): 512–530, CiteSeerX 10.1.1.66.3717, doi:10.1006/jcss.2001.1774.
- Karpinski, Marek; Schudy, Warren (2010), "Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament", Proc. ISAAC 2010, Part I, Lecture Notes in Computer Science, 6506: 3–14, arXiv:1006.4396, doi:10.1007/978-3-642-17517-6_3, ISBN 978-3-642-17516-9.
- Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket (2011), "Known algorithms on graphs of bounded treewidth are probably optimal", Proc. 22nd ACM/SIAM Symposium on Discrete Algorithms (SODA 2011) (PDF), pp. 777–789, arXiv:1007.5450, Bibcode:2010arXiv1007.5450L, archived from the original (PDF) on 2012-10-18, retrieved 2011-05-19.
- Pătraşcu, Mihai; Williams, Ryan (2010), "On the possibility of faster SAT algorithms", Proc. 21st ACM/SIAM Symposium on Discrete Algorithms (SODA 2010) (PDF), pp. 1065–1075.
- Williams, Ryan (2010), "Improving exhaustive search implies superpolynomial lower bounds", Proc. 42nd ACM Symposium on Theory of Computing (STOC 2010), New York, NY, USA: ACM, pp. 231–240, CiteSeerX 10.1.1.216.1299, doi:10.1145/1806689.1806723, ISBN 9781450300506.
- Woeginger, Gerhard (2003), "Exact algorithms for NP-hard problems: A survey", Combinatorial Optimization — Eureka, You Shrink! (PDF), Lecture Notes in Computer Science, 2570, Springer-Verlag, pp. 185–207, CiteSeerX 10.1.1.168.5383, doi:10.1007/3-540-36478-1_17, ISBN 978-3-540-00580-3.