Author:
Alekhnovich Michael,Ben-Sasson Eli,Razborov Alexander A.,Wigderson Avi
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Subject
General Mathematics,General Computer Science
Cited by
67 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On the Range Avoidance Problem for Circuits;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
2. Iterated lower bound formulas: a diagonalization-based approach to proof complexity;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
3. Strong co-nondeterministic lower bounds for NP cannot be proved feasibly;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
4. Hardness Magnification Near State-of-the-Art Lower Bounds;Theory of Computing;2021
5. Automating Tree-Like Resolution in Time n(log ) Is ETH-Hard;Procedia Computer Science;2021