Concepedia

Space Complexity Of Proofs

The Space Complexity of Proofs is a complexity measure in proof theory that quantifies the minimal amount of memory required by a proof system to verify a given logical formula, distinguishing it from other complexity measures by focusing on the peak storage used during the verification process rather than the length or depth of the proof.

26

Publications

1.3K

Citations

43

Authors

35

Institutions

Publications per year

2017–2026

4

Parents

Publications

26

1–5 of 26

Authors

43

  1. JN
    Jakob Nordstr”öm

    KTH Royal Institute of Technology, Sweden

    10 publications · 219 citations

    10

    h-index

  2. EB
    Eli Ben‐Sasson

    Technion – Israel Institute of Technology, Israel

    5 publications · 115 citations

    5

    h-index

  3. NT
    Neil Thapen

    Czech Academy of Sciences, Czechia

    2 publications · 56 citations

    2

    h-index

  4. ML
    Massimo Lauria

    KTH Royal Institute of Technology, Sweden

    2 publications · 56 citations

    2

    h-index

  5. RD
    Ron D. Rothblum

    Weizmann Institute of Science, Israel

    2 publications · 186 citations

    2

    h-index

1–5 of 43

Institutions

35

  1. KTH Royal Institute of Technology

    Stockholm, Sweden

    8 h-index

    11 publications

    237 citations

  2. Technion – Israel Institute of Technology

    Haifa, Israel

    4 h-index

    4 publications

    56 citations

  3. Massachusetts Institute of Technology

    Cambridge, United States

    4 h-index

    5 publications

    203 citations

  4. University of Toronto

    Toronto, Canada

    3 h-index

    4 publications

    76 citations

  5. Princeton University

    Princeton, United States

    2 h-index

    2 publications

    119 citations

  6. Sapienza University of Rome

    Rome, Italy

    2 h-index

    3 publications

    49 citations

  7. Institute of Science and Technology Austria

    Klosterneuburg, Austria

    2 h-index

    2 publications

    29 citations

  8. Czech Academy of Sciences

    Prague, Czechia

    2 h-index

    2 publications

    56 citations

1–8 of 35

Venues

  1. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 3 publications · 41 citations

    3

    h-index

  2. SIAM Journal on Computing

    2 publications · 79 citations

    2

    h-index

  3. IACR Cryptology ePrint Archive

    Repository · 1 publications · 21 citations

    1

    h-index

  4. 1

    h-index

  5. arXiv (Cornell University)

    Repository · 1 publications · 14 citations

    1

    h-index

1–5