Nearly Optimal Pseudorandomness from Hardness

Dean Doron; Dana Moshkovitz; Justin Oh; David Zuckerman

doi:10.1145/3555307

Nearly Optimal Pseudorandomness from Hardness

Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman

Department of Computer Science

Ben-Gurion University of the Negev

Research output: Contribution to journal › Article › peer-review

Abstract

Existing proofs that deduce BPP = P from circuit lower bounds convert randomized algorithms into deterministic algorithms with a large polynomial slowdown. We convert randomized algorithms into deterministic ones with little slowdown.

Original language	English
Article number	43
Pages (from-to)	1-55
Journal	Journal of the ACM
Volume	69
Issue number	6
DOIs	https://doi.org/10.1145/3555307
State	Published - 17 Nov 2022

Keywords

Pseudorandom generators
list recovery
local list decoding
pseudoentropy
quantified derandomization

All Science Journal Classification (ASJC) codes

Software
Control and Systems Engineering
Information Systems
Hardware and Architecture
Artificial Intelligence

Access to Document

10.1145/3555307

Cite this

@article{17fba33c3eb04c26b096326d02c51469,

title = "Nearly Optimal Pseudorandomness from Hardness",

abstract = "Existing proofs that deduce BPP = P from circuit lower bounds convert randomized algorithms into deterministic algorithms with a large polynomial slowdown. We convert randomized algorithms into deterministic ones with little slowdown.",

keywords = "Pseudorandom generators, list recovery, local list decoding, pseudoentropy, quantified derandomization",

author = "Dean Doron and Dana Moshkovitz and Justin Oh and David Zuckerman",

note = "Publisher Copyright: {\textcopyright} coNP circuits, formally known as randomized SVN circuits",

year = "2022",

month = nov,

day = "17",

doi = "10.1145/3555307",

language = "الإنجليزيّة",

volume = "69",

pages = "1--55",

journal = "Journal of the ACM",

issn = "0004-5411",

publisher = "Association for Computing Machinery (ACM)",

number = "6",

}

TY - JOUR

T1 - Nearly Optimal Pseudorandomness from Hardness

AU - Doron, Dean

AU - Moshkovitz, Dana

AU - Oh, Justin

AU - Zuckerman, David

N1 - Publisher Copyright: © coNP circuits, formally known as randomized SVN circuits

PY - 2022/11/17

Y1 - 2022/11/17

N2 - Existing proofs that deduce BPP = P from circuit lower bounds convert randomized algorithms into deterministic algorithms with a large polynomial slowdown. We convert randomized algorithms into deterministic ones with little slowdown.

AB - Existing proofs that deduce BPP = P from circuit lower bounds convert randomized algorithms into deterministic algorithms with a large polynomial slowdown. We convert randomized algorithms into deterministic ones with little slowdown.

KW - Pseudorandom generators

KW - list recovery

KW - local list decoding

KW - pseudoentropy

KW - quantified derandomization

UR - http://www.scopus.com/inward/record.url?scp=85146370397&partnerID=8YFLogxK

U2 - 10.1145/3555307

DO - 10.1145/3555307

M3 - مقالة

SN - 0004-5411

VL - 69

SP - 1

EP - 55

JO - Journal of the ACM

JF - Journal of the ACM

IS - 6

M1 - 43

ER -

Nearly Optimal Pseudorandomness from Hardness

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this