Abstract
The Exponential Time Hypothesis (ETH) is a conjecture stating that, roughly speaking, n-variable 3-SAT cannot be solved in time 2o(n). In this chapter, we prove lower bounds based on ETH for the time needed to solve various problems. In many cases, these lower bounds match (up to small factors) the running time of the best known algorithms for the problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Cygan, M. et al. (2015). Lower Bounds Based on the Exponential-Time Hypothesis. In: Parameterized Algorithms. Springer, Cham. https://doi.org/10.1007/978-3-319-21275-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-21275-3_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21274-6
Online ISBN: 978-3-319-21275-3
eBook Packages: Computer ScienceComputer Science (R0)