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

Authors

69

  1. UE
    Uwe Egly

    TU Wien, Austria

    2 publications · 32 citations

    2

    h-index

  2. AK
    Akihiro Kishimoto

    University of Alberta, Canada

    2 publications · 48 citations

    2

    h-index

  3. MM
    Martin Müller

    University of Alberta, Canada

    2 publications · 48 citations

    2

    h-index

  4. RK
    Roman Kuznets

    University of Bern, Switzerland

    2 publications · 52 citations

    2

    h-index

  5. JK
    Jan Krajı́ček

    Czech Academy of Sciences, Institute of Mathematics, Czechia

    2 publications · 124 citations

    2

    h-index

1–5 of 69

Venues

  1. Theoretical Computer Science

    3 publications · 99 citations

    3

    h-index

  2. Information Sciences

    2 publications · 35 citations

    2

    h-index

  3. International Joint Conference on Artificial Intelligence

    Conference · 2 publications · 45 citations

    2

    h-index

  4. Electronic Notes in Theoretical Computer Science

    ENTCS · 2 publications · 33 citations

    2

    h-index

  5. Logic Journal of IGPL

    2 publications · 33 citations

    2

    h-index

1–5