Nisan-Wigderson generators in proof complexity: new lower bounds

DOI10.4230/LIPICS.CCC.2022.17MaRDI QIDQ6568359zbMATH OpenFDO

Authors Erfan Khaniki

Publication date 5 July 2024

zbMATH Keywords

lower boundsbounded arithmeticproof complexitymeta-complexitybounded depth FregeNisan-wigderson generators

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: Nisan-Wigderson generators in proof complexity: new lower bounds

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