Pseudorandomness when the odds are against you

DOI10.4230/LIPIcs.CCC.2016.9zbMath1380.68434OpenAlexW2461326806MaRDI QIDQ5368743

Valentine Kabanets, Sergei Artemenko, Ronen Shaltiel, Russell Impagliazzo

Publication date: 10 October 2017

Full work available at URL: https://doi.org/10.4230/lipics.ccc.2016.9

zbMATH Keywords

relative errorderandomizationpseudorandom generatorhitting-set generator

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

Related Items (2)

Incompressible functions, relative-error extractors, and the power of nondeterministic reductions ⋮ The Journey from NP to TFNP Hardness

This page was built for publication: Pseudorandomness when the odds are against you