Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > TAL ELBAZ:
All reports by Author Tal Elbaz:

TR25-080 | 20th June 2025
Tal Elbaz, Nashlen Govindasamy, Jiaqi Lu, Iddo Tzameret

Lower Bounds against the Ideal Proof System in Finite Fields

Lower bounds against strong algebraic proof systems and specifically fragments of the Ideal Proof System (IPS), have been obtained in an ongoing line of work. All of these bounds, however, are proved only over large (or characteristic 0) fields,1 yet finite fields are the more natural setting for propositional proof ... more >>>




ISSN 1433-8092 | Imprint