Pairwise Independence and Derandomization

DOI10.1561/0400000009zbMath1143.68402OpenAlexW2032821770MaRDI QIDQ3522268

Avi Wigderson, Michael Luby

Publication date: 1 September 2008

Published in: Foundations and Trends® in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.8687

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (5)

Combinatorial Auctions with Conflict-Based Externalities ⋮ Universal Hashing via Integer Arithmetic Without Primes, Revisited ⋮ Parameterized random complexity ⋮ On possible dependence structures of a set of random variables ⋮ A partial derandomization of phaselift using spherical designs

This page was built for publication: Pairwise Independence and Derandomization