Proof Search Complexity
Proof Search Complexity is a theoretical framework in computational logic that measures the computational resources required to find proofs within propositional proof systems, distinguished from related complexity notions by focusing on the search process rather than the size or structure of proofs themselves.
41
Publications
2.2K
Citations
69
Authors
47
Institutions
Publications per year
2017–2026
3
Parents
41
1–5 of 41
69
2
h-index
2
h-index
2
h-index
2
h-index
Czech Academy of Sciences, Institute of Mathematics, Czechia
2 publications · 124 citations
2
h-index
1–5 of 69
47

TU Wien
Vienna, Austria
5 h-index
8 publications
179 citations

University of Alberta
Edmonton, Canada
2 h-index
3 publications
62 citations
University of California San Diego
San Diego, United States
2 h-index
2 publications
141 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
2 publications
128 citations

Cornell University
Ithaca, United States
2 h-index
2 publications
286 citations
Maastricht University
Maastricht, The Netherlands
2 h-index
8 publications
129 citations
Google (United States)
Mountain View, United States
1 h-index
1 publications
11 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
1 h-index
2 publications
118 citations
1–8 of 47
3 publications · 99 citations
3
h-index
2 publications · 35 citations
2
h-index
Conference · 2 publications · 45 citations
2
h-index
ENTCS · 2 publications · 33 citations
2
h-index
2 publications · 33 citations
2
h-index
1–5