Attention:The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Thursday, October 15th until 12:00 AM ET on Friday, October 16th due to maintenance. We apologize for the inconvenience.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Cryptographic hardness under projections for time-bounded Kolmogorov complexity
Award ID(s):
1909216 1909683 1852215 1836666
PAR ID:
10380025
Author(s) / Creator(s):
; ; ;
Date Published:
Journal Name:
Theoretical Computer Science
ISSN:
0304-3975
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Text Encoded Conversion
  • XML
  • Save / Share this Record
  • Send to Email