Keyword

Exponential Time Hypothesis

Description: The Exponential Time Hypothesis is a computational complexity conjecture that 3-SAT cannot be solved in subexponential time in the worst case.
Wikidata ID: wiki/Q5421532
OpenAlex ID: keywords/exponential-time-hypothesis
2001 · Russell Impagliazzo, Ramamohan Paturi · Journal of Computer and System Sciences · 1,665
2011 · Marek Cygan, Jesper Nederlof, et al. · Annual Symposium on Foundations of Computer Science · 386
2015 · Marek Cygan, Fedor V. Fomin, et al. · Springer eBooks · 350
2006 · Jianer Chen, Xiuzhen Huang, et al. · Journal of Computer and System Sciences · 350
2014 · Boaz Barak, Sanjam Garg, et al. · Lecture notes in computer science · 270
2003 · R. Impagliazzo, R. Paturi · IEEE Conference on Computational Complexity (CCC) · 245
2016 · Aviad Rubinstein · ACM SIGecom Exchanges · 194
2010 · Daniel Marx · Theory of Computing · 192
2018 · Daniel Lokshtanov, Dániel Marx, et al. · SIAM Journal on Computing · 184
2014 · Holger Dell, Thore Husfeldt, et al. · ACM Transactions on Algorithms · 139
2007 · Daniel Marx · Annual Symposium on Foundations of Computer Science · 139
2016 · Pål Grønås Drange, Markus Dregi, et al. · Algorithmica · 135
2004 · Jianer Chen, Xiuzhen Huang, et al. · ACM Symposium on Theory of Computing (STOC) · 125
2018 · Ajwani, Deepak, Bisseling, Rob H., et al. · arXiv (Cornell University) · 118
2016 · Marek Cygan, Marcin Pilipczuk, et al. · SIAM Journal on Computing · 107
2019 · Eleni C. Akrida, George B. Mertzios, et al. · Journal of Computer and System Sciences · 104
2015 · Dana Moshkovitz · Theory of Computing · 104
2014 · Radu Curticapean, Daniel Marx · Annual Symposium on Foundations of Computer Science · 100
2020 · Klaus Jansen, Kim-Manuel Klein, et al. · Mathematics of Operations Research · 97
2019 · Karthik C. S., Bundit Laekhanukit, et al. · Journal of the ACM · 92
2007 · Daniel Marx · Annual Symposium on Foundations of Computer Science · 92
2024 · Édouard Bonnet, Colin Geniet, et al. · SIAM Journal on Computing · 86
2011 · Daniel Lokshtanov, Daniel Marx, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 86
2014 · Mark Braverman, Young Kun Ko, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 85
Works count: 995
Citation count: 15,570
Year
Topic
Type