Lower bounds for polynomial calculus: non-binomial case

DOI10.1109/SFCS.2001.959893MaRDI QIDQ7240049zbMATH OpenFDO

Authors Michael Alekhnovich, Alexander Razborov

Publication date 8 May 2026

Full work available at URL https://doi.org/10.1109/SFCS.2001.959893

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(2)

• Refuting perfect matchings in spectral expanders is hard
• New bounds for the ideal proof system in positive characteristic

This page was built for publication: Lower bounds for polynomial calculus: non-binomial case

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