Simple hard instances for low-depth algebraic proofs

DOI10.1109/FOCS54457.2022.00025MaRDI QIDQ6943069zbMATH OpenFDO

Authors Tuomas Hakoniemi, Iddo Tzameret, Nashlen Govindasamy

Publication date 15 August 2025

Full work available at URL https://doi.org/10.1109/FOCS54457.2022.00025

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(5)

• Low-depth algebraic circuit lower bounds over any field
• Superpolynomial lower bounds against low-depth algebraic circuits
• Polynomial calculus for quantified Boolean logic: lower bounds through circuits and degree
• Symmetric proofs in the ideal proof system
• New bounds for the ideal proof system in positive characteristic

This page was built for publication: Simple hard instances for low-depth algebraic proofs

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