Robustness of average-case meta-complexity via pseudorandomness-Reference-Cited by-同舟云学术

Robustness of average-case meta-complexity via pseudorandomness

Published:2022-06-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Ilango Rahul¹,Ren Hanlin²,Santhanam Rahul²

Affiliation:

1. Massachusetts Institute of Technology, USA

2. Oxford University, UK

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519935.3520051

Reference56 articles.

1. When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity

2. Eric Allender . 2020 . The New Complexity Landscape Around Circuit Minimization. In Language and Automata Theory and Applications - 14th International Conference , LATA 2020, Milan, Italy, March 4-6, 2020, Proceedings (Lecture Notes in Computer Science , Vol. 12038). Springer, 3– 16 . Eric Allender. 2020. The New Complexity Landscape Around Circuit Minimization. In Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Milan, Italy, March 4-6, 2020, Proceedings (Lecture Notes in Computer Science, Vol. 12038). Springer, 3–16.

3. Power from Random Strings

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Learning in Pessiland via Inductive Inference;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. SAT Reduces to the Minimum Circuit Size Problem with a Random Oracle;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

5. On One-Way Functions and Sparse Languages;Theory of Cryptography;2023