Randomness-Efficient Sampling Within NC 1

DOI10.1007/11830924_37zbMath1155.68391OpenAlexW1966484193MaRDI QIDQ3595383

Alexander D. Healy

Publication date: 28 August 2007

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11830924_37

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20)

Related Items (1)

Basic Facts about Expander Graphs

This page was built for publication: Randomness-Efficient Sampling Within NC 1