Proof Complexity of Resolution Refutations is a theoretical framework in computational complexity theory that measures the minimal size or length of resolution refutations required to prove the unsatisfiability of propositional formulas, thereby characterizing the efficiency and limitations of resolution-based proof systems.
16
Publications
1.1K
Citations
27
Authors
26
Institutions
Publications per year
2017–2026
1
Parents
Publications
16
Alasdair Urquhart · Journal of the ACM · 1987 · 451 citations · Full text
Simplified and improved resolution lower bounds
Paul Beame, Toniann Pitassi · 2002 · 197 citations
1–5 of 16
Authors
27
- AU
3
h-index
- NG
3
h-index
- ML
2
h-index
- SB
2
h-index
- DA
1
h-index
1–5 of 27
Institutions
26
Universitat Politècnica de Catalunya
Barcelona, Spain
3 h-index
3 publications
142 citations
Sapienza University of Rome
Rome, Italy
2 h-index
4 publications
88 citations
University of California San Diego
San Diego, United States
2 h-index
3 publications
194 citations
University of Toronto
Toronto, Canada
2 h-index
2 publications
504 citations
University of Washington
Seattle, United States
1 h-index
2 publications
394 citations
KTH Royal Institute of Technology
Stockholm, Sweden
1 h-index
1 publications
54 citations
United States Public Health Service
Washington D.C., United States
1 h-index
2 publications
42 citations
Czech Academy of Sciences
Prague, Czechia
1 h-index
1 publications
13 citations
1–8 of 26
Venues
- ACM Transactions on Computational Logic
TOCL · 2 publications · 85 citations
2
h-index
- SIAM Journal on Computing
2 publications · 101 citations
2
h-index
- Proceedings of the AAAI Conference on Artificial Intelligence
Conference · 1 publications · 23 citations
1
h-index
- Journal of the ACM
JACM · 1 publications · 451 citations
1
h-index
- Logical Methods in Computer Science
LMCS · 1 publications · 40 citations
1
h-index
1–5