Keyword

2-SAT

Description: A Boolean satisfiability problem in theoretical computer science in which each clause contains at most two literals.
Wikidata ID: wiki/Q4596967
OpenAlex ID: keywords/2-sat
1998 · Mihir Bellare, Oded Goldreich, et al. · SIAM Journal on Computing · 530
2002 · C.H. Papadimitriou · Annual Symposium on Foundations of Computer Science · 295
2002 · Evgeny Dantsin, Andreas Goerdt, et al. · Theoretical Computer Science · 253
2001 · Béla Bollobás, Christian Borgs, et al. · Random Structures and Algorithms · 244
2010 · Mihai Pătraşcu, Ryan Williams · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 233
2009 · Igor Razgon, Barry O'Sullivan · Journal of Computer and System Sciences · 172
· Mihai Patrascu, Ryan Williams · 164
2015 · Andrew R. Francis, Mike Steel · Systematic Biology · 138
2017 · Per Austrin, Venkatesan Guruswami, et al. · SIAM Journal on Computing · 102
2004 · Vilhelm Dahllöf, Peter Jonsson, et al. · Theoretical Computer Science · 101
2001 · Dimitris Achlioptas, Lefteris M. Kirousis, et al. · Theoretical Computer Science · 84
2010 · Ian Davidson, S. S. Ravi, et al. · SIAM International Conference on Data Mining · 80
1998 · Uri Zwick · ACM Symposium on Theory of Computing (STOC) · 67
2008 · Magnus Wahlström · Springer eBooks · 64
1992 · Dan Gusfield, Leonard Pitt · Algorithmica · 51
1996 · Etienne Grandjean · Annals of Mathematics and Artificial Intelligence · 49
2008 · K.J. Batenburg, W.A. Kosters · Pattern Recognition · 48
2021 · Alyaa Alway, Nur Ezlin Zamri, et al. · International Journal of Computer Mathematics · 47
2006 · Josep Argelich, Felip Manyà · Journal of Heuristics · 44
2004 · Michael Molloy · TSpace (University of Toronto) · 44
1990 · Vijaya Chandru, Collette R. Coullard, et al. · Annals of Mathematics and Artificial Intelligence · 41
2014 · Dario Tamascelli, Luca Zanetti · Journal of Physics A Mathematical and Theoretical · 40
2013 · Emmanuel Abbe, Andrea Montanari · Random Structures and Algorithms · 36
Works count: 443
Citation count: 5,051
Year
Topic
Type