{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:54:17Z","timestamp":1754488457844,"version":"3.41.0"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T00:00:00Z","timestamp":1338508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1017760"],"award-info":[{"award-number":["CCF-1017760"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2012,6]]},"abstract":"<jats:p>Exploring the power and potential of geometric complexity theory.<\/jats:p>","DOI":"10.1145\/2184319.2184341","type":"journal-article","created":{"date-parts":[[2012,5,23]],"date-time":"2012-05-23T15:47:01Z","timestamp":1337788021000},"page":"98-107","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["The GCT program toward the\n            <i>P<\/i>\n            vs.\n            <i>NP<\/i>\n            problem"],"prefix":"10.1145","volume":"55","author":[{"given":"Ketan D.","family":"Mulmuley","sequence":"first","affiliation":[{"name":"University of Chicago, IL"}]}],"member":"320","published-online":{"date-parts":[[2012,6]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11590156_6"},{"key":"e_1_2_2_2_1","first-page":"439","article-title":"Every planar map is four colourable","volume":"21","author":"Appel K.","year":"1977","unstructured":"Appel , K. , Haken , W. , Koch , J . Every planar map is four colourable . Illinois J. Math. 21 ( 1977 ), 439 -- 567 . Appel, K., Haken, W., Koch, J. Every planar map is four colourable. Illinois J. Math. 21 (1977), 439--567.","journal-title":"Illinois J. Math."},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1540612"},{"key":"e_1_2_2_4_1","volume-title":"Geometric complexity theory IV: nonstandard quantum group for the Kronecker problem. cs. ArXiv preprint cs. CC\/0703110","author":"Blasiak J.","year":"2011","unstructured":"Blasiak , J. , Mulmuley , K. , Sohoni , M. Geometric complexity theory IV: nonstandard quantum group for the Kronecker problem. cs. ArXiv preprint cs. CC\/0703110 ( 2011 ). Blasiak, J., Mulmuley, K., Sohoni, M. Geometric complexity theory IV: nonstandard quantum group for the Kronecker problem. cs. ArXiv preprint cs. CC\/0703110 (2011)."},{"key":"e_1_2_2_5_1","volume-title":"The complexity of finite functions. Handbook of Theoretical Computer Science","author":"Boppana R.","year":"1990","unstructured":"Boppana , R. , Sipser , M. The complexity of finite functions. Handbook of Theoretical Computer Science . J. van Leeuwen, ed. Volume A , MIT press, 1990 , 757--804. Boppana, R., Sipser, M. The complexity of finite functions. Handbook of Theoretical Computer Science. J. van Leeuwen, ed. Volume A, MIT press, 1990, 757--804."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1965416"},{"key":"e_1_2_2_7_1","volume-title":"Geometric complexity theory and tensor rank. arXiv:1011.1350v1","author":"B\u00fcrgisser P.","year":"2010","unstructured":"B\u00fcrgisser , P. and Ikenmeyer , C . Geometric complexity theory and tensor rank. arXiv:1011.1350v1 ( 2010 ). B\u00fcrgisser, P. and Ikenmeyer, C. Geometric complexity theory and tensor rank. arXiv:1011.1350v1 (2010)."},{"key":"e_1_2_2_8_1","volume-title":"An overview of mathematical issues arising in the geometric complexity theory approach to VP \u2260 VNP. arXiv:0907.2850v1 {cs.CC}","author":"B\u00fcrgisser P.","year":"2009","unstructured":"B\u00fcrgisser , P. , Landsberg , J. , Manivel , L. , Weyman , J. An overview of mathematical issues arising in the geometric complexity theory approach to VP \u2260 VNP. arXiv:0907.2850v1 {cs.CC} ( 2009 ). B\u00fcrgisser, P., Landsberg, J., Manivel, L., Weyman, J. An overview of mathematical issues arising in the geometric complexity theory approach to VP \u2260 VNP. arXiv:0907.2850v1 {cs.CC} (2009)."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_2_2_10_1","first-page":"137","article-title":"La conjecture de weil II. Publ. Math. Inst. Hau. \u00c9tud","volume":"52","author":"Deligne P","year":"1980","unstructured":"Deligne , P . La conjecture de weil II. Publ. Math. Inst. Hau. \u00c9tud . Sci. 52 ( 1980 ), 137 -- 252 . Deligne, P. La conjecture de weil II. Publ. Math. Inst. Hau. \u00c9tud. Sci. 52 (1980), 137--252.","journal-title":"Sci."},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1562164.1562186"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-004-0182-6"},{"key":"e_1_2_2_13_1","volume-title":"Reducibility among combinatorial problems. Complexity of Computer Computations","author":"Karp R.","year":"1972","unstructured":"Karp , R. Reducibility among combinatorial problems. Complexity of Computer Computations . R. Miller and J. Thatcher, eds. Plenum Press , New York , 1972 , 85--103. Karp, R. Reducibility among combinatorial problems. Complexity of Computer Computations. R. Miller and J. Thatcher, eds. Plenum Press, New York, 1972, 85--103."},{"key":"e_1_2_2_14_1","volume-title":"Hypersurfaces with degenerate duals and the geometric complexity theory program. arXiv:1004.4802v1 {math.AG}","author":"Landsberg J.","year":"2010","unstructured":"Landsberg , J. , Manivel , L. , Ressayre , N. Hypersurfaces with degenerate duals and the geometric complexity theory program. arXiv:1004.4802v1 {math.AG} ( 2010 ). Landsberg, J., Manivel, L., Ressayre, N. Hypersurfaces with degenerate duals and the geometric complexity theory program. arXiv:1004.4802v1 {math.AG} (2010)."},{"key":"e_1_2_2_15_1","volume-title":"Universal sequential search problems. Probl. Inform. transm. 9","author":"Levin L.","year":"1973","unstructured":"Levin , L. Universal sequential search problems. Probl. Inform. transm. 9 ( 1973 ), 115--116. Levin, L. Universal sequential search problems. Probl. Inform. transm. 9 (1973), 115--116."},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1155\/S1073792804142566"},{"key":"e_1_2_2_17_1","unstructured":"Mulmuley K. Geometric Complexity Theory IX. Technical report under preparation.  Mulmuley K. Geometric Complexity Theory IX . Technical report under preparation."},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794282930"},{"key":"e_1_2_2_21_1","volume-title":"Explicit proofs and the flip. arXiv:1009.0246 v1 {cs.CC}","author":"Mulmuley K.","year":"2010","unstructured":"Mulmuley , K. Explicit proofs and the flip. arXiv:1009.0246 v1 {cs.CC} ( 2010 ). Mulmuley, K. Explicit proofs and the flip. arXiv:1009.0246 v1 {cs.CC} (2010)."},{"key":"e_1_2_2_22_1","volume-title":"The Computer Science Department","author":"Mulmuley K.","year":"2010","unstructured":"Mulmuley , K. Geometric Complexity Theory VI: The Flip via Positivity. Technical report , The Computer Science Department , The University of Chicago , 2010 . Mulmuley, K. Geometric Complexity Theory VI: The Flip via Positivity. Technical report, The Computer Science Department, The University of Chicago, 2010."},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1944345.1944346"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10801-011-0325-1"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970038715X"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/080718115"},{"key":"e_1_2_2_27_1","first-page":"798","article-title":"Lower bounds on the monotone complexity of some Boolean functions","volume":"281","author":"Razborov A","year":"1985","unstructured":"Razborov , A . Lower bounds on the monotone complexity of some Boolean functions . Dokl. Akad. Nauk SSSR 281 ( 1985 ), 798 -- 801 . Razborov, A. Lower bounds on the monotone complexity of some Boolean functions. Dokl. Akad. Nauk SSSR 281 (1985), 798--801.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(83)80041-X"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"e_1_2_2_30_1","volume-title":"Princeton University Press","author":"Weyl H.","year":"1946","unstructured":"Weyl , H. Classical Groups , Princeton University Press , Princeton, NJ , 1946 . Weyl, H. Classical Groups, Princeton University Press, Princeton, NJ, 1946."}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2184319.2184341","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2184319.2184341","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:10Z","timestamp":1750236550000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2184319.2184341"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":28,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["10.1145\/2184319.2184341"],"URL":"https:\/\/doi.org\/10.1145\/2184319.2184341","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"type":"print","value":"0001-0782"},{"type":"electronic","value":"1557-7317"}],"subject":[],"published":{"date-parts":[[2012,6]]},"assertion":[{"value":"2012-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}