Pseudorandom generators without the XOR Lemma (extended abstract)
From MaRDI portal
Publication:2819586
DOI10.1145/301250.301397zbMath1345.68138OpenAlexW2063130531MaRDI QIDQ2819586
Luca Trevisan, Madhu Sudan, Salil P. Vadhan
Publication date: 29 September 2016
Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/301250.301397
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
In search of an easy witness: Exponential time vs. probabilistic polynomial time. ⋮ Computational wiretap coding from indistinguishability obfuscation ⋮ Constructing near spanning trees with few local inspections ⋮ Lower bounds for adaptive locally decodable codes ⋮ Locally Decodable Codes: A Brief Survey ⋮ Local computation algorithms for graphs of non-constant degrees ⋮ Some Recent Results on Local Testing of Sparse Linear Codes ⋮ Pseudorandom generators without the XOR lemma ⋮ Extractors from Reed-Muller codes ⋮ Extracting all the randomness and reducing the error in Trevisan's extractors ⋮ Exponential lower bound for 2-query locally decodable codes via a quantum argument ⋮ High-rate codes with sublinear-time decoding
This page was built for publication: Pseudorandom generators without the XOR Lemma (extended abstract)
