Author:
Murray Cody D.,Williams R. Ryan
Funder
National Science Foundation
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Subject
General Mathematics,General Computer Science
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1;Computability;2023-06-21
2. Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. Depth- Threshold Circuits vs. Depth-(+1) AND-OR Trees;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. On the Range Avoidance Problem for Circuits;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
5. 3.1
n
−
o
(
n
) circuit lower bounds for explicit functions;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09