A new rank technique for formula size lower bounds

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4393 LNCS, Issue , 2007, Pages 145-156

  Lee, Troy ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FUNCTION EVALUATION;

FORMULA SIZE LOWER BOUNDS; PARITY FUNCTION; QUANTUM ADVERSARY METHOD;

MATRIX ALGEBRA;

EID: 38049098429     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70918-3_13     Document Type: Conference Paper

References (17)

1. A. Ambainis. Quantum lower bounds by quantum arguments. Journal of Computer and System Sciences, 64:750-767, 2002.
2. A. Ambainis. Polynomial degree vs. quantum query complexity. In Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, pages 230-239. IEEE, 2003.
3. H. Barnum, M. Saks, and M. Szegedy. Quantum decision trees and semidefinite programming. In Proceedings of the 18th IEEE Conference on Computational Complexity, pages 179-193, 2003.
4. J. Hástad. The shrinkage exponent is 2. SIAM Journal on Computing, 27:48-64, 1998.
5. V.M. Khrapchenko. Complexity of the realization of a linear function in the case of ∏-circuits. Math. Notes Acad. Sciences, 9:21-23, 1971.
6. M. Karchmer, E. Kushilevitz, and N. Nisan. Fractional covers and communication complexity. SIAM Journal on Discrete Mathematics, 8(1):76-92, 1995.
7. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
8. E. Koutsoupias. Improvements on Khrapchenko's theorem. Theoretical Computer Science, 116(2):399-403, 1993.
9. M. Karchmer and A. Wigderson. Monotone connectivity circuits require super-logarithmic depth. In Proceedings of the 20th ACM Symposium on the Theory of Computing, pages 539-550, 1988.
10. S. Laplante, T. Lee, and M. Szegedy. The quantum adversary method and classical formula size lower bounds. Computational Complexity, 15:163-196, 2006.
11. K. Melhorn and E. Schmidt. Las Vegas is better than determinism in VLSI and distributed computing. In Proceedings of the 14th ACM Symposium on the Theory of Computing, pages 330-337. ACM, 1982.
12. E. I. Nečiporuk. A Boolean function. Soviet Mathematics-Doklady, 7:999-1000, 1966.
13. M. Paterson, N. Pippenger, and U. Zwick. Optimal carry save networks. In Boolean function complexity, pages 174-201. London Mathematical Society Lecture Note Series 169, Cambridge University Press, 1992.
14. J. Radhakrishnan. Better lower bounds for monotone threshold formulas. Journal of Computer and System Sciences, 54(2):221-226, 1997.
15. A. Razborov. Applications of matrix methods to the theory of lower bounds in computational complexity. Combinatorica, 10(1):81-93, 1990.
16. A. Razborov. On submodular complexity measures. In M. Paterson, editor, Boolean function complexity, volume 169 of London Math. Soc. Lecture Notes Series, pages 76-83. Cambridge University Press, 1992.
17. L.G. Valiant. Short monotone formulae for the majority function. Journal of Algorithms, 5:363-366, 1984.