Pseudorandom generators, resolution and heavy width

DOI10.4230/LIPICS.CCC.2022.15MaRDI QIDQ6568356zbMATH OpenFDO

Authors D. Sokoloff

Publication date 5 July 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CCC.2022.15

zbMATH Keywords

lower boundsresolutionproof complexitypseudorandom generators

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: Pseudorandom generators, resolution and heavy width

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