Pseudorandom generators from polarizing random walks

DOI10.4086/TOC.2019.V015A010zbMATH Open1435.68217OpenAlexW3037248839MaRDI QIDQ5204828FDOQ5204828

Authors: Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett 

Publication date: 5 December 2019

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2019.v015a010

Recommendations

• scientific article; zbMATH DE number 7250141
• Pseudorandom generators for low sensitivity functions
• Pseudorandom generators for low degree polynomials

zbMATH Keywords

random walkpseudorandom generator

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Randomized algorithms (68W20) Sums of independent random variables; random walks (60G50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Boolean functions (06E30)

Cited In (8)

• A random-walk pseudorandom byte generator
• Pseudorandom generators for low sensitivity functions
• Paradigms for Unconditional Pseudorandom Generators
• Title not available (Why is that?)
• Title not available (Why is that?)
• Near-optimal derandomization of medium-width branching programs
• Quantum cryptography in Algorithmica
• Pseudorandomness via the discrete Fourier transform

This page was built for publication: Pseudorandom generators from polarizing random walks

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