Author:
Golovnev Alexander,Hirsch Edward A.,Knop Alexander,Kulikov Alexander S.
Funder
Government of the Russian Federation
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference41 articles.
1. Algebrization: a new barrier in complexity theory;Aaronson;ACM Trans. Comput. Theory,2009
2. Two theorems on random polynomial time;Adleman,1978
3. A well-mixed function with circuit complexity 5n: tightness of the lachish-raz-type bounds;Amano;Theor. Comput. Sci.,2011
4. Computational Complexity – A Modern Approach;Arora,2009
5. Relativizations of the P=?NP question;Baker;SIAM J. Comput.,1975
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. 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