Publisher
Society for Industrial & Applied Mathematics (SIAM)
Subject
General Mathematics,General Computer Science
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Depth- Threshold Circuits vs. Depth-(+1) AND-OR Trees;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. Guest Column;ACM SIGACT News;2023-02-28
3. From Circuit Complexity to Faster All-Pairs Shortest Paths;SIAM Review;2021-01
4. Faster All-Pairs Shortest Paths via Circuit Complexity;SIAM Journal on Computing;2018-01
5. Uniform proofs of ACC representations;Archive for Mathematical Logic;2017-05-26