Hitting sets for regular branching programs

DOI10.4230/LIPICS.CCC.2022.3MaRDI QIDQ6568342zbMATH OpenFDO

Authors Andrey Yu. Bogdanov, William M. Hoza, Gautam Prakriya, Edward Pyne

Publication date 5 July 2024

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

zbMATH Keywords

hitting set generatorspseudorandomnessspace-bounded computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(5)

• Pseudorandom generators for sliding-window algorithms
• Recursive error reduction for regular branching programs
• Pseudodistributions that beat all pseudorandom generators
• Implications of better PRGs for permutation branching programs
• On sums of INW pseudorandom generators

This page was built for publication: Hitting sets for regular branching programs

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