Proof Complexity

Proof Complexity is a branch of theoretical computer science that studies the computational resources required by proof systems to establish the validity of propositional tautologies, particularly focusing on the minimal size or length of proofs relative to the complexity of the statements being proved.

1.6K

Publications

100.7K

Citations

2.2K

Authors

792

Institutions

Publications per year

2017–2026

177

Authors

2.2K

  1. TP
    Toniann Pitassi

    University of Toronto, Canada

    25 publications · 1.4K citations

    20

    h-index

  2. EB
    Eli Ben‐Sasson

    Technion – Israel Institute of Technology, Israel

    27 publications · 1.8K citations

    18

    h-index

  3. OG
    Oded Goldreich

    Weizmann Institute of Science, Israel

    16 publications · 3.6K citations

    16

    h-index

  4. SR
    Samuel R. Buss

    University of California San Diego, United States

    16 publications · 724 citations

    14

    h-index

  5. JN
    Jakob Nordstr”öm

    KTH Royal Institute of Technology, Sweden

    19 publications · 515 citations

    14

    h-index

1–5 of 2.2K

Venues

  1. Theoretical Computer Science

    78 publications · 3.9K citations

    32

    h-index

  2. Journal of Automated Reasoning

    54 publications · 2.6K citations

    26

    h-index

  3. Journal of Symbolic Logic

    31 publications · 4K citations

    25

    h-index

  4. Annals of Pure and Applied Logic

    44 publications · 1.7K citations

    25

    h-index

  5. SIAM Journal on Computing

    24 publications · 3.9K citations

    24

    h-index

1–5