Author:
Beame P.,Impagliazzo R.,Pitassi T.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Tree-depth, quantifier elimination, and quantifier rank;Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science;2018-07-09
2. Formulas versus Circuits for Small Distance Connectivity;SIAM Journal on Computing;2018-01
3. An improved homomorphism preservation theorem from lower bounds in circuit complexity;ACM SIGLOG News;2016-12-15
4. Near-optimal small-depth lower bounds for small distance connectivity;Proceedings of the forty-eighth annual ACM symposium on Theory of Computing;2016-06-19
5. Formulas vs. circuits for small distance connectivity;Proceedings of the forty-sixth annual ACM symposium on Theory of computing;2014-05-31