From proof complexity to circuit complexity via interactive protocols

DOI10.4230/LIPICS.ICALP.2024.12MaRDI QIDQ6875199zbMATH OpenFDO

Authors Noel Arteche, Erfan Khaniki, Ján Pich, Rahul Santhanam

Publication date 14 January 2026

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

proof complexitycircuit complexityinteractive protocols

Mathematics Subject Classification ID

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

This page was built for publication: From proof complexity to circuit complexity via interactive protocols

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