Algebraic proof systems (invited talk)

DOI10.4230/LIPICS.ICALP.2021.5MaRDI QIDQ7241101zbMATH OpenFDO

Authors Toniann Pitassi

Publication date 12 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2021.5

zbMATH Keywords

algebraic circuitscomplexity theoryproof complexity

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• Circuit complexity, proof complexity, and polynomial identity testing. The ideal proof system
• Iterated lower bound formulas: a diagonalization-based approach to proof complexity
• Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative?

This page was built for publication: Algebraic proof systems (invited talk)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241101)