One-Way Functions and the Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions
- Award ID(s):
- 2149305
- PAR ID:
- 10553246
- Publisher / Repository:
- Springer
- Date Published:
- Format(s):
- Medium: X
- Location:
- CRYPTO'23
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
An official website of the United States government

