Cited By
View all- Huang YIlango RRen HSaha BServedio R(2023)NP-Hardness of Approximating Meta-Complexity: A Cryptographic ApproachProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585154(1067-1075)Online publication date: 2-Jun-2023
- Ilango R(2023)SAT Reduces to the Minimum Circuit Size Problem with a Random Oracle2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00048(733-742)Online publication date: 6-Nov-2023
- Ball MLiu YMazor NPass R(2023)Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00034(458-483)Online publication date: 6-Nov-2023
- Show More Cited By