On Problems as Hard as CNF-SAT

@article{Cygan2012OnPA,
  title={On Problems as Hard as CNF-SAT},
  author={Marek Cygan and Holger Dell and Daniel Lokshtanov and D'niel Marx and Jesper Nederlof and Yoshio Okamoto and Ramamohan Paturi and Saket Saurabh and Magnus Wahlstrom},
  journal={2012 IEEE 27th Conference on Computational Complexity},
  year={2012},
  pages={74-84}
}
The field of exact exponential time algorithms for NP-hard problems has thrived over the last decade. While exhaustive search remains asymptotically the fastest known algorithm for some basic problems, difficult and non-trivial exponential time algorithms have been found for a myriad of problems, including GRAPH COLORING, HAMILTONIAN PATH, DOMINATING SET and 3-CNF-SAT. In some instances, improving these algorithms further seems to be out of reach. The CNF-SAT problem is the canonical example of… 

Figures from this paper

On Problems as Hard as CNF-SATx

It is shown that, for every < 1, the problems HITTING SET, SET SPLITTing, and NAE-SAT cannot be computed in time O(2 ) unless SETH fails, and it is proved that the fastest known algorithms for STEINTER TREE, CONNECTED VERTEX COVER, SET PARTITIONING, and the pseudo-polynomial time algorithm for SUBSET SUM cannot be significantly improved.

Polynomial formulations as a barrier for reduction-based hardness proofs

Evidence is provided that such fine-grained reductions will be difficult to derive Set Cover Conjecture from SETH, and that proving c n lower bound for any constant c > 1 (not just c = 2) under SETH for any of the problems above would imply new circuit lower bounds.

Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis

A stronger version of Impagliazzo et al.'s sparsification lemma for k-SAT is proved; namely that all finite Boolean constraint languages S and S' such that SAT(·) is NP-complete can be sparsified into each other.

Exact exponential algorithms for two poset problems

  • L. Kozma
  • Mathematics, Computer Science
    SWAT
  • 2020
Partially ordered sets (posets) are fundamental combinatorial objects with important applications in computer science. Perhaps the most natural algorithmic task, given a size-$n$ poset, is to compute

Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems

It is proved that sufficient progress would imply a breakthrough on one of five major open problems in the theory of algorithms, including dynamic versions of bipartite perfect matching, bipartites maximum weight matching, single source reachability, single sources shortest paths, strong connectivity, subgraph connectivity, diameter approximation and some nongraph problems.

SETH-Based Lower Bounds for Subset Sum and Bicriteria Path

A tight reduction is achieved from k -SAT to Subset Sum on dense instances, proving that Bellman’s 1962 pseudo-polynomial time algorithm cannot be improved to time T 1-ε · 2 o(n) for any ε > 0, unless the Strong Exponential Time Hypothesis (SETH) fails.

Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)

Evidence is provided that a problem $A$ with a running time O(n^k) that has not been improved in decades, also requires n^{k-o(1)} time, thus explaining the lack of progress on the problem.

Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs

This paper develops an algorithm running in O(2^{O((k log k)^{2/3})}n) time and polynomial space, where k is the size of the Steiner tree and n is the number of vertices of the graph.

Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal

This paper demonstrates the existence of maximally hard pattern graphs H that require time n tw( H )+1 − o (1) and proves the following asymptotic statement for large treewidth t: under the Strong Exponential Time Hypothesis (SETH), a standard assumption from fine-grained complexity theory.

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

It is shown that the aforementioned gap cannot be breached for some problems that aim to maximize the number of connected components like Cycle Packing, and in several cases it is able to show that improving those constants would cause the Strong Exponential Time Hypothesis to fail.
...

References

SHOWING 1-10 OF 41 REFERENCES

On Problems as Hard as CNF-SATx

It is shown that, for every < 1, the problems HITTING SET, SET SPLITTing, and NAE-SAT cannot be computed in time O(2 ) unless SETH fails, and it is proved that the fastest known algorithms for STEINTER TREE, CONNECTED VERTEX COVER, SET PARTITIONING, and the pseudo-polynomial time algorithm for SUBSET SUM cannot be significantly improved.

Which problems have strongly exponential complexity?

  • R. ImpagliazzoR. PaturiF. Zane
  • Computer Science, Mathematics
    Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
  • 1998
For several NP-complete problems, there have been a progression of better but still exponential algorithms. In this paper we address the relative likelihood of sub-exponential algorithms for these

Tight lower bounds for certain parameterized NP-hard problems

  • Jianer ChenB. Chor Ge Xia
  • Computer Science
    Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.
  • 2004
It is proved that a group of parameterized NP-hard problems, including weighted SAT, dominating set, hitting set, set cover, and feature set, cannot be solved in time n/sup o(k)/poly(m), where n is the size of the universal set from which the k elements are to be selected and m is the instance size.

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

It is shown that the aforementioned gap cannot be breached for some problems that aim to maximize the number of connected components like Cycle Packing, and in several cases it is able to show that improving those constants would cause the Strong Exponential Time Hypothesis to fail.

Exact (Exponential) Algorithms for the Dominating Set Problem

This paper designs fast exact algorithms for the problem of computing a minimum dominating set in undirected graphs with ‘nice’ exponential time complexities that are bounded by functions of the form cn with reasonably small constants c<2.

The Complexity of Satisfiability of Small Depth Circuits

An improved randomized algorithm for the satisfiability problem for circuits of constant depth d and a linear number of gates cn is shown: for each d and c, the running time is 2(1 ? ?)n where the improvement $\delta\geq 1/O(c^{2-2-1}\lg^{3\cdot 2^{d-2}- 2}c)$, and the constant in the big-Oh depends only on d.

A Note on the Complexity of the Chromatic Number Problem

A measure & conquer approach for the analysis of exact algorithms

The idea is that a smarter measure may capture behaviors of the algorithm that a standard measure might not be able to exploit, and hence lead to a significantly better worst-case time analysis, in order to step beyond limitations of current algorithms design.

On the Limits of Sparsification

This work defines a pseudo-random function generator with seed length f(n) such that with high probability, a function in the output of this generator does not have depth-3 circuits of size 2n−o( n) with bounded bottom fan-in, solving a long-standing open question.

Exact Exponential-Time Algorithms for Domination Problems in Graphs

This PhD thesis studies exact exponential-time algorithms for domination problems in graphs, which are algorithms that use a number of operations that is exponential in a complexity parameter of the input in the worst case and return an optimal solution to the problem.