Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis
Abstract
References
Index Terms
- Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis
Recommendations
The exponential time hypothesis and the parameterized clique problem
IPEC'12: Proceedings of the 7th international conference on Parameterized and Exact ComputationIn parameterized complexity there are three natural definitions of fixed-parameter tractability called strongly uniform, weakly uniform and nonuniform fpt. Similarly, there are three notions of subexponential time, yielding three flavours of the ...
On parameterized exponential time complexity
In this paper we study the notion of parameterized exponential time complexity. We show that a parameterized problem can be solved in parameterized 2^o^(^f^(^k^)^)p(n) time if and only if it is solvable in time O(2^@d^f^(^k^)q(n)) for any constant @d>0, ...
Complexity of SAT problems, clone theory and the exponential time hypothesis
SODA '13: Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithmsThe construction of exact exponential-time algorithms for NP-complete problems has for some time been a very active research area. Unfortunately, there is a lack of general methods for studying and comparing the time complexity of algorithms for such ...
Comments
Information & Contributors
Information
Published In
- General Chairs:
- Bojan Mohar,
- Igor Shinkar,
- Program Chair:
- Ryan O'Donnell
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- NSF (National Science Foundation)
- Simons Institute for the Theory of Computing, University of California Berkeley
- Alfred P. Sloan Foundation
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 428Total Downloads
- Downloads (Last 12 months)428
- Downloads (Last 6 weeks)91
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in