Ideal Proof Systems is a theoretical framework in proof complexity that characterizes the class of propositional proof systems simulatable by polynomial-size algebraic circuits operating over a given field, distinguishing it from other proof systems by its intrinsic connection to algebraic computation and circuit-based proof representation.
4
Publications
134
Citations
4
Authors
4
Institutions
Publications per year
2017–2026
0
Parents
Publications
4
Doing arithmetic with diagrams
Alan Bundy · Edinburgh Research Explorer · 1973 · 57 citations · Full text
1–4 of 4
Authors
4
- JKJan Krajı́ček
Czech Academy of Sciences, Institute of Mathematics, Czechia
1 publications · 48 citations
1
h-index
- JG
1
h-index
- MA
1
h-index
- AB
1
h-index
1–4 of 4
Institutions
4
University of Oxford
Oxford, United Kingdom
1 h-index
1 publications
48 citations
California Institute of Technology
Pasadena, United States
1 h-index
1 publications
16 citations
Mathematical Institute of the Slovak Academy of Sciences
Bratislava, Slovakia
1 h-index
1 publications
48 citations
University of Edinburgh
Edinburgh, United Kingdom
1 h-index
1 publications
57 citations
1–4 of 4
Venues
- Proceedings of the London Mathematical Society
1 publications · 48 citations
1
h-index
- SIAM Journal on Computing
1 publications · 13 citations
1
h-index
- Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences
1 publications · 16 citations
1
h-index
- Edinburgh Research Explorer
Repository · 1 publications · 57 citations
1
h-index
1–4