Regular ArticlePolynomial Time Samplable Distributions☆
Under an Elsevier user license
open archive
Keywords
average-case complexity
sampling algorithm
domination condition
strong one-way functions
Cited by (0)
- ☆
A preliminary version of the paper appeared in the Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 1113, pp. 566–578, 1996.
- f1
E-mail: [email protected]
- 2
Current affiliation: Department of Computer Science, Princeton University, Princeton, NJ 08544.
Copyright © 1999 Academic Press. All rights reserved.