Pseudorandom generators in propositional proof complexity

DOI10.1109/SFCS.2000.892064MaRDI QIDQ7239930zbMATH OpenFDO

Authors Michael Alekhnovich, Eli Ben-Sasson, Alexander Razborov, A. Wigderson

Publication date 8 May 2026

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

Mathematics Subject Classification ID

Computer science (68-XX)

This page was built for publication: Pseudorandom generators in propositional proof complexity

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