Lower bounds based on the Exponential Time Hypothesis

@article{Lokshtanov2011LowerBB,
  title={Lower bounds based on the Exponential Time Hypothesis},
  author={Daniel Lokshtanov and D{\'a}niel Marx and Saket Saurabh},
  journal={Bulletin of the EATCS},
  year={2011},
  volume={105},
  pages={41-72}
}
In this article we survey algorithmic lower bound results that have been obtained in the field of exact exponential time algorithms and parameterized complexity under certain assumptions on the running time of algorithms solving CNF-Sat, namely Exponential time hypothesis (ETH) and Strong Exponential time hypothesis (SETH). 
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
158 Citations
52 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 158 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 52 references

On the optimality of planar and geometric approximation schemes

  • D. Marx
  • FOCS, IEEE Computer Society
  • 2007
Highly Influential
7 Excerpts

Similar Papers

Loading similar papers…