Author:
Karakostas George,Kinne Jeff,van Melkebeek Dieter
Subject
General Computer Science,Theoretical Computer Science
Reference24 articles.
1. Computational Complexity: A Modern Approach;Arora,2009
2. Optimal bounds for the approximation of Boolean functions and some applications;Andreev;Theoretical Computer Science,1997
3. Miklós Ajtai, János Komlós, Endre Szemerédi, An 0(n log n) sorting network, in: Proceedings of the ACM Symposium on Theory of Computing, 1983, pp. 1–9.
4. The Probabilistic Method;Alon,2000
5. S.J. Berkowitz, On some relationships between monotone and non-monotone circuit complexity. Technical Report, University of Toronto, 1982.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献