Publisher
Springer International Publishing
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Nondeterministic Quasi-Polynomial Time is Average-Case Hard for \(\textsf{ACC}\) Circuits;SIAM Journal on Computing;2024-02-23
2. Constant Depth Formula and Partial Function Versions of MCSP Are Hard;SIAM Journal on Computing;2022-08-31
3. Robustness of average-case meta-complexity via pseudorandomness;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
4. The Minimum Formula Size Problem is (ETH) Hard;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
5. Guest Column;ACM SIGACT News;2021-12-20