Keyword

tree-like resolution

Description: Tree-like resolution is a proof system in computational logic where each derived clause is used at most once.
OpenAlex ID: keywords/tree-like-resolution
2001 · Eli Ben-Sasson, Avi Wigderson · Journal of the ACM · 536
1996 · Matthew Clegg, Jeffery Edmonds, et al. · ACM Symposium on Theory of Computing (STOC) · 388
2000 · Maria Luisa Bonet, Juan Luis Esteban, et al. · SIAM Journal on Computing · 137
1999 · Eli Ben-Sasson, Avi Wigderson · ACM Symposium on Theory of Computing (STOC) · 136
2006 · Ke Xu, Wei Li · Theoretical Computer Science · 115
2004 · Eli Ben-Sasson*, Russell Impagliazzo†, et al. · COMBINATORICA · 115
2008 · Michael Alekhnovich, Alexander A. Razborov · SIAM Journal on Computing · 80
2001 · M. Alekhnovich, A.A. Razboro · Annual Symposium on Foundations of Computer Science · 80
1998 · Sam Buss, Toniann Pitassi · Lecture notes in computer science · 80
2000 · Eli Ben‐Sasson, Russell Impagliazzo, et al. · Electronic colloquium on computational complexity · 68
2005 · Joey Hwang, David G. Mitchell · Lecture notes in computer science · 61
2013 · Olaf Beyersdorff, Nicola Galesi, et al. · Information Processing Letters · 59
2003 · Stefan Dantchev, Søren Riis · Lecture notes in computer science · 53
2004 · Michael Alekhnovich, Edward A. Hirsch, et al. · Lecture notes in computer science · 48
2019 · Dmitry Itsykson, Dmitry Sokolov · Annals of Pure and Applied Logic · 46
2012 · Matti Järvisalo, Arie Matsliah, et al. · Lecture notes in computer science · 37
2017 · Sam Buss, Jan Johannsen · Journal on Satisfiability Boolean Modeling and Computation · 33
2004 · P. Beame, R. Impagliazzo, et al. · IEEE Conference on Computational Complexity (CCC) · 32
2013 · Zi Chao Wang · Logical Methods in Computer Science · 30
2010 · Olaf Beyersdorff, Nicola Galesi, et al. · Information Processing Letters · 27
2022 · Chattopadhyay, Arkadev, Mande, Nikhil S., et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 22
2016 · Beyersdorff, Olaf, Chew, Leroy, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 20
2013 · Jacobo Torán · Lecture notes in computer science · 20
2017 · Olaf Beyersdorff, Leroy Chew, et al. · ACM Transactions on Computational Logic · 19
2021 · Goldwasser, Shafi, Impagliazzo, Russell, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 18
Works count: 105
Citation count: 2,508
Year
Topic
Type