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
Parents
17
Geometry theorem proving using Hilbert's Nullstellensatz
Deepak Kapur · 1986 · 90 citations · Full text
Lower bounds on Hilbert's Nullstellensatz and propositional proofs
Paul Beame, Russell Impagliazzo, Toniann Pitassi et al. · 2002 · 57 citations
1–5 of 17
25
5
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 25
24
University of California San Diego
San Diego, United States
4 h-index
6 publications
251 citations

University of Toronto
Toronto, Canada
2 h-index
3 publications
64 citations
University of Washington
Seattle, United States
2 h-index
2 publications
222 citations
University of Pittsburgh
Pittsburgh, United States
2 h-index
3 publications
387 citations
Mathematical Institute of the Slovak Academy of Sciences
Bratislava, Slovakia
1 h-index
1 publications
48 citations
University of Oxford
Oxford, United Kingdom
1 h-index
1 publications
48 citations
General Electric (United States)
Boston, United States
1 h-index
1 publications
90 citations

Rice University
Houston, United States
1 h-index
1 publications
25 citations
1–8 of 24
2 publications · 41 citations
2
h-index
2 publications · 213 citations
2
h-index
1 publications · 19 citations
1
h-index
TRAN · 1 publications · 46 citations
1
h-index
TOCL · 1 publications · 33 citations
1
h-index
1–5