On P vs. NP and geometric complexity theory

Journal of the ACM

Volumn 58, Issue 2, 2011, Pages

  Mulmuley, Ketan D ^a  

^a THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

Geometric complexity theory; NP; P

Indexed keywords

ALGEBRAIC GEOMETRY; DECOMPOSITION THEOREMS; GEOMETRIC COMPLEXITY; LOWER BOUNDS; NP; NP PROBLEMS; P; REPRESENTATION THEORY; SUB-PROBLEMS;

COMPUTATIONAL COMPLEXITY; DOMAIN DECOMPOSITION METHODS;

GEOMETRY;

EID: 79953888767     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1944345.1944346     Document Type: Article

References (50)

1. Aaronson, S., and Wigderson, A. 2009. Algebrization: A new barrier in complexity theory. ACM Trans. Comput. Theory 1, 1, 2:1-2:54.
2. Agrawal, M. 2005. Proving lower bounds via pseudo-random generators. In Proceedings of the FSTTCS. Springer-Verlag, Berlin, Germany, 92-105. (Pubitemid 43846895)
3. Atserias, A. 2005. Non-uniform hardness for np via black-box adversaries. ECCC, report 154.
4. Boppana, R., and Sipser, M. 1990. The complexity of finite functions. In Handbook of Theoretical Computer Science, Volume A, 757-804.
5. Burgisser, P., and Ikenmeyer, C. 2010. Geometric complexity theory and tensor rank. arXiv:1011.1350 v1 [cs.CC].
6. Bürgisser, P., Landsberg, J., Manivel, L., and Weyman, J. 2009. An overview of mathematical issues arising in the geometric complexity theory approach to VP ≠ VNP. arXiv: 0907.2850v1 [cs.CC].
7. Cook, S. 1971. The complexity of theorem-proving procedures. In Proceedings of the 3rd Annual ACM Symposium on Theory of Computing. ACM, New York, 151-158.
8. Deligne, P., and Milne, J. 1981. Hodge cycles, motives and shimura varieties. Lecture Notes in Mathematics vol. 900, Springer, Berlin, Germany, 101-228
9. Drinfeld, V. 1988. Quantum groups. In Proceedings of the International Congress of Mathematics (1986). vol. 1. American Mathematical Society, Providence, 798-820.
10. Fortnow, L., Pavan, A., and Sengupta, S. 2008. Proving SAT does not have small circuits with an application to the two queries problem. J. Comput. Syst. Sci. 74, 358-363.
11. Frobenius, G. 1897. Uber die darstellung der endlichen gruppen durch lineare substitutionen. In Sitzungsber Deutsch, Akad. Wiss, Berlin, 994-1015.
12. Fulton, W. 1997. Young Tableau. Cambridge University Press, Cambridge, UK.
13. Fulton, W., and Harris, J. 1991. Representation Theory, A First Course. Springer, Berlin, Germany.
14. Grötschel, M., Lovász, L., and Schrijver, A. 1993. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin, Germany.
15. Gurvits, L. 2005. On the complexity of mixed determinants and related problems. Lecture Notes in Computer Science, vol. 3618. Springer-Verlag, Berlin, Germany, 447-458. (Pubitemid 41449520)
16. Impagliazzo, R., and Wigderson, A. 1997. P = BPP unless E has sub-exponential circuits: Derandomizing the XOR lemma. In Proceedings of the 29th Symposium on Theory Of Computing. ACM, New York, 220-229.
17. Kabanets, V., and Impagliazzo, R. 2004. Derandomizing polynomial identity tests means proving circuit lower bounds. Computat. Compl. 13, 1-46. (Pubitemid 41217703)
18. Karp, R. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations, Plenum Press, New York, 85-103.
19. Karp, R., and Ramachandran, V. 1990. Parallel algorithms for shared memory machines. In Handbook of Theoretical Computer Science (vol. A). Elsevier, 869-941.
20. King, R., Tollu, C., and Toumazet, F. 2004. Stretched littlewood-richardson coefficients and kostka coefficients. In Symmetry in Physics, American Mathematical Society, Providence, 99-112.
21. n(C) tensor products I: proof of the saturation conjecture. J. Amer. Math. Soc. 12, 1055-1090.
22. Knutson, A., and Tao, T. 2001. Honeycombs and sums of hermitian matrices. Notices Amer. Math. Soc. 48, 2, 175-186.
23. Kumar, S. 2010. Geometry of orbits of permanents and determinants. arXiv:1007.1695 v1 [math.AG].
24. Landsberg, J., Manivel, L., and Ressayre, N. 2010. Hypersurfaces with degenerate duals and the geometric complexity theory program. arXiv:1004.4802 vl [math.AG].
25. Levin, A. 1973. Universal sequential search problems. Prob.Inf. Trans.9, 115-116.
26. Luna, D., and Vust, T. 1983. Plongements d'espaces homogenes. Comment. Math. Helv. 58, 186-245.
27. Marcus, M., and May, F. 1962. The permanent function. Canad. J. Math. 14, 177-189.
28. Mayr, E., and Meyer, A. 1982. The complexity of the word problems for commutative semigroups and polynomial ideals. Adv. Math. 46, 3, 305-329.
29. Mignon, T., and Ressayre, N. 2004. A quadratic bound for the determinant and permanent problem. Int. Math. Res. Not., 4241-4253. (Pubitemid 41017086)
30. Mulmuley, K. 1999. Lower bounds in a parallel model without bit operations. SIAMJ. Comput. 28, 4, 1460-1509.
31. Mulmuley, K. 2007a. Geometric complexity theory VII: Nonstandard quantum group for the plethysm problem. Tech. rep. TR-2007-14, Computer Science Department, The University of Chicago, Chicago, IL.
32. Mulmuley, K. 2007b. Geometric complexity theory VIII: On canonical bases for the nonstandard quantum groups. Tech. rep. TR 2007-15, Computer Science Department, The University of Chicago, Chicago, IL.
33. Mulmuley, K. 2010a. Explicit proofs and the flip. arXiv:1009.0246 v1 [cs.CC].
34. Mulmuley, K. 2010b. Geometric complexity theory. Video of FOCS'10 http://techtalks.tv/focs/2010.
35. Mulmuley, K. 2010c. Geometric complexity theory VI: The flip via positivity. Tech. rep., The Computer Science Department, The University of Chicago, Chicago, IL.
36. Mulmuley, K., and Narayanan, H. 2007. Geometric complexity theory V: On deciding nonvanishing of a generalized littlewood-richardson coefficient. Tech. rep., Department of Computer Science, The University of Chicago, Chicago, IL.
37. Mulmuley, K., and Sohoni, M. 2001. Geometric complexity theory I: An approach to the P vs. NP and related problems. SIAMJ. Comput. 31, 2, 496-526. (Pubitemid 33782963)
38. Mulmuley, K., and Sohoni, M. 2005. Geometric complexity theory III: On deciding positivity of littlewoodrichardson coefficients. cs. ArXiv preprint cs. CC/0501076 v1.
39. Mulmuley, K., and Sohoni, M. 2007. Geometric complexity theory IV: Quantum group for the Kronecker problem. cs. ArXiv preprint cs. CC/0703110.
40. Mulmuley, K., and Sohoni, M. 2008. Geometric complexity theory II: Towards explicit obstructions for embeddings among class varieties. SIAMJ. Comput. 38, 3, 1175-1206.
41. Mumford, D. 1976. Algebraic Geometry I: Complex Projective Varieties. Springer, Berlin, Germany.
42. Mumford, D., Fogarty, J., and Kirwan, F. 1994. Geometric Invariant Theory. Springer-Verlag, Berlin, Germany.
43. Nisan, N., and Wigderson, A. 1994. Hardness vs. randomness. J. Comput.Sys.Sci.49, 2, 149-167.
44. Rassart, E. 2004. A polynomiality property for littlewood-richardson coefficients. J. Combin. Theory, Series A 107, 2, 161-179. (Pubitemid 39025572)
45. Razborov, A. 1985. Lower bounds on the monotone complexity of some Boolean functions. Doklady Akademii Nauk SSSR 281, 798-801.
46. Razborov, A. and Rudich, S. 1997. Natural proofs. J. Comput. System Sci. 55, 24-35. (Pubitemid 127433391)
47. Stanley, R. 1987. Enumerative Combinatorics, vol. 1. Cambridge University Press, Cambridge, UK
48. Strassen, V. 1983. Rank and optimal computation of generic tensors. Lin. Algebra Appl. 53, 645-685
49. Strassen, V. 1987. Relative bilinear complexity and matrix multiplication. J. Reigne Angnew. Math. 376, 406-443.
50. Valiant, L. 1979. The complexity of computing the permanent. Theor. Comput. Sci. 8, 189-201.