A Note on Hardness under Projections for Graph Isomorphism and Time-Bounded Kolmogorov Complexity

Eric Allender, Azucena Garvia Bosshard, Amulya Musipatla. A Note on Hardness under Projections for Graph Isomorphism and Time-Bounded Kolmogorov Complexity. Electronic Colloquium on Computational Complexity (ECCC), 27:158, 2020. [doi]

Abstract

Abstract is missing.