Abstract
We describe efficient constructions of small probability spaces that approximate the independent distribution for general random variables. Previous work on efficient constructions concentrate on approximations of the independent distribution for the special case of uniform boolean-valued random variables. Our results yield efficient constructions of small sets with low discrepancy in high dimensional space and have applications to de-randomizing randomized algorithms.
Original language | English |
---|---|
Title of host publication | Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992 |
Publisher | Association for Computing Machinery |
Pages | 10-16 |
Number of pages | 7 |
ISBN (Electronic) | 0897915119 |
DOIs | |
State | Published - 1 Jul 1992 |
Event | 24th Annual ACM Symposium on Theory of Computing, STOC 1992 - Victoria, Canada Duration: 4 May 1992 → 6 May 1992 |
Publication series
Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
---|---|
Volume | Part F129722 |
ISSN (Print) | 0737-8017 |
Conference
Conference | 24th Annual ACM Symposium on Theory of Computing, STOC 1992 |
---|---|
Country/Territory | Canada |
City | Victoria |
Period | 4/05/92 → 6/05/92 |
Bibliographical note
Publisher Copyright:© 1992 ACM.