A Note on Hardness under Projections for Graph Isomorphism and Time-Bounded Kolmogorov Complexity
- Award ID(s):
- 1852215
- NSF-PAR ID:
- 10217481
- Date Published:
- Journal Name:
- Electronic colloquium on computational complexity
- ISSN:
- 1433-8092
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- The DOI is not currently available.
