Nullstellensatz Proof Systems

Nullstellensatz Proof Systems is a proof system in propositional logic based on algebraic reasoning, wherein proofs are represented as polynomial families over a field certifying the unsatisfiability of propositional formulas via Hilbert’s Nullstellensatz.

17

Publications

810

Citations

25

Authors

24

Institutions

Publications per year

2017–2026

0

Variants

Nullstellensatz Proof System

Authors

25

  1. RI
    Russell Impagliazzo

    University of California San Diego, United States

    5 publications · 325 citations

    5

    h-index

  2. NS
    Nathan Segerlind

    University of California San Diego, United States

    3 publications · 103 citations

    3

    h-index

  3. TM
    Tsuyoshi Morioka

    University of Toronto, Canada

    3 publications · 67 citations

    3

    h-index

  4. SR
    Samuel R. Buss

    University of California San Diego, United States

    2 publications · 75 citations

    2

    h-index

  5. PB
    Paul Beame

    University of Washington, United States

    2 publications · 222 citations

    2

    h-index

1–5 of 25

Venues

  1. Journal of Symbolic Computation

    2 publications · 41 citations

    2

    h-index

  2. Proceedings of the London Mathematical Society

    2 publications · 213 citations

    2

    h-index

  3. Linear Algebra and its Applications

    1 publications · 19 citations

    1

    h-index

  4. Transactions of the American Mathematical Society

    TRAN · 1 publications · 46 citations

    1

    h-index

  5. ACM Transactions on Computational Logic

    TOCL · 1 publications · 33 citations

    1

    h-index

1–5