Author:
Chen Ruiwen,Kabanets Valentine,Saurabh Nitin
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Andreev, A.E.: On a method of obtaining more than quadratic effective lower bounds for the complexity of π-schemes. Vestnik Moskovskogo Universiteta. Matematika 42(1), 70–73 (1987); english translation in Moscow University Mathematics Bulletin
2. Beame, P., Impagliazzo, R., Srinivasan, S.: Approximating AC
0 by small height decision trees and a deterministic algorithm for #AC
0SAT. In: Proceedings of the Twenty-Seventh Annual IEEE Conference on Computational Complexity, pp. 117–125 (2012)
3. Chen, R., Kabanets, V., Kolokolova, A., Shaltiel, R., Zuckerman, D.: Mining circuit lower bound proofs for meta-algorithms. In: Proceedings of the Twenty-Ninth Annual IEEE Conference on Computational Complexity (2014)
4. Chen, R., Kabanets, V., Saurabh, N.: An improved deterministic #SAT algorithm for small De Morgan formulas. Electronic Colloquium on Computational Complexity (ECCC) 20, 150 (2013)
5. Håstad, J.: Almost optimal lower bounds for small depth circuits. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pp. 6–20 (1986)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献