Keyword

k-SAT

Description: A Boolean satisfiability problem asking whether a formula in conjunctive normal form, with clauses of at most k literals, can be satisfied.
Wikidata ID: wiki/Q875276
OpenAlex ID: keywords/k-sat
2001 · Russell Impagliazzo, Ramamohan Paturi, et al. · Journal of Computer and System Sciences · 1,867
2001 · Russell Impagliazzo, Ramamohan Paturi · Journal of Computer and System Sciences · 1,662
1991 · Peter Cheeseman, Bob Kanefsky, et al. · International Joint Conference on Artificial Intelligence · 1,223
1999 · Ehud Friedgut, appendix by Jean Bourgain · Journal of the American Mathematical Society · 797
1994 · Scott Kirkpatrick, Bart Selman · Science · 677
2003 · T. Schoning · Annual Symposium on Foundations of Computer Science · 488
2008 · Grant Schoenebeck · Annual Symposium on Foundations of Computer Science · 350
2005 · Uriel Feige, Eran Ofek · Random Structures and Algorithms · 293
2005 · Ramamohan Paturi, Pavel Pudlák, et al. · Journal of the ACM · 289
2005 · M. Mézard, T. Mora, et al. · Physical Review Letters · 264
2002 · Evgeny Dantsin, Andreas Goerdt, et al. · Theoretical Computer Science · 253
2003 · R. Impagliazzo, R. Paturi · IEEE Conference on Computational Complexity (CCC) · 244
1996 · Alan Frieze, Stephen Suen · Journal of Algorithms · 241
1998 · Lefteris M. Kirousis, Evangelos Kranakis, et al. · Random Structures and Algorithms · 209
· Dimitris Achlioptas, Amin Coja-oghlan · 205
2002 · R. Impagliazzo, R. Paturi, et al. · Annual Symposium on Foundations of Computer Science · 199
2007 · Florent Krzakala, Jorge Kurchan · Physical Review E · 171
2002 · R. Paturi, P. Pudlik, et al. · Annual Symposium on Foundations of Computer Science · 167
2011 · Mária Ercsey-Ravasz, Zoltán Toroczkai · Nature Physics · 164
2011 · Rubinfeld, Ronitt, Tamir, Gil, et al. · arXiv (Cornell University) · 164
2004 · Andrea Montanari, Giorgio Parisi, et al. · Journal of Physics A Mathematical and General · 145
1996 · Bart Selman, Scott Kirkpatrick · Artificial Intelligence · 144
2006 · C. Calabro, R. Impagliazzo, et al. · IEEE Conference on Computational Complexity (CCC) · 136
2000 · Pavel Pudlák, Russell Impagliazzo · Symposium on Discrete Algorithms · 121
Works count: 441
Citation count: 14,510
Year
Topic
Type