On Problems as Hard as CNF-SAT

@article{Cygan2012OnPA,
  title={On Problems as Hard as CNF-SAT},
  author={M. Cygan and Holger Dell and D. Lokshtanov and D. Marx and J. Nederlof and Y. Okamoto and R. Paturi and S. 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… Expand
134 Citations
On Problems as Hard as CNF-SATx
  • PDF
Exact exponential algorithms for two poset problems
  • L. Kozma
  • Mathematics, Computer Science
  • SWAT
  • 2020
  • PDF
SETH-Based Lower Bounds for Subset Sum and Bicriteria Path
  • 46
  • PDF
Strong partial clones and the time complexity of SAT problems
  • 17
  • PDF
Known Algorithms for Edge Clique Cover are Probably Optimal
  • 46
  • PDF
The Quantum Strong Exponential-Time Hypothesis
  • 6
  • PDF
Faster exponential-time algorithms in graphs of bounded average degree
  • 21
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 29 REFERENCES
Exact (Exponential) Algorithms for the Dominating Set Problem
  • 125
  • PDF
On the complexity of K -SAT
  • 495
  • PDF
A measure & conquer approach for the analysis of exact algorithms
  • 221
  • PDF
On the Limits of Sparsification
  • 24
  • PDF
A duality between clause width and clause density for SAT
  • 135
  • PDF
...
1
2
3
...