Geometric complexity theory: Difference between revisions

Browse history interactively

← Previous edit

Content deleted Content added

VisualWikitext

Revision as of 14:23, 2 January 2018 edit TakuyaMurata (talk \| contribs) Extended confirmed users, IP block exemptions, Pending changes reviewers 92,676 edits →External links: add a link to a mathoverflow thread (in part to address a comment it in the talk) ← Previous edit		Latest revision as of 23:58, 19 June 2025 edit undo OAbot (talk \| contribs) Bots 643,717 edits m Open access bot: url-access updated in citation with #oabot.
(7 intermediate revisions by 6 users not shown)
Line 11: \| title = The Status of the P Versus NP Problem \| volume = 52 \| year = 2009}}\| citeseerx = 10.~~</ref>~~1.1.156.767 \| s2cid = 5969255 }}.</ref> The program is pursued by several researchers in mathematics and theoretical computer science. Part of the reason for the interest in the program is the existence of arguments for the program avoiding known barriers such as [[Oracle machine\|relativization]] and [[natural proof]]s for proving general lower bounds.<ref>{{Cite journal\|last=Mulmuley\|first=Ketan D.\|date=2011-04-01\|title=On P vs. NP and geometric complexity theory: Dedicated to Sri Ramakrishna\|url=http://dl.acm.org/citation.cfm?id=1944345.1944346\|journal=Journal of the ACM\|volume=58\|issue=2\|pages=5\|doi=10.1145/1944345.1944346\|s2cid=7703175 \|issn=0004-5411\|url-access=subscription}}</ref> == References == Line 25 ⟶ 27: K. D. Mulmuley, H. Narayanan, and M. Sohoni. Geometric complexity theory III: on deciding nonvanishing of a Littlewood-Richardson coefficient. J. Algebraic Combin. 36 (2012), no. 1, 103–110. K. D. Mulmuley. Geometric Complexity Theory V: ~~Equivalence~~Efficient ~~between~~algorithms ~~blackbox~~for ~~derandomization~~Noether ofnormalization. ~~polynomial~~J. ~~identity~~Amer. ~~testing~~Math. ~~and~~Soc. ~~derandomization~~30 of(2017), ~~Noether's Normalization Lemma~~no. ~~FOCS 2012~~1, ~~also~~225-309. [[arxiv:1209.5993\|arXiv:1209.5993 [cs.CC]]] K. D. Mulmuley. Geometric Complexity Theory VI: the flip via positivity., Technical Report, Computer Science department, The University of Chicago, January 2011. Line 32 ⟶ 34: * [http://gct.cs.uchicago.edu/ GCT page, University of Chicago] * [http://simons.berkeley.edu/workshop_alggeometry1.html Description on the Simons Institute webpage] * [~~http~~https://cstheory.stackexchange.com/questions/tagged/gct GCT questions] on [[cstheory]] * [~~http~~https://cstheory.stackexchange.com/aq/17629 Wikipedia-style explanation of Geometric Complexity Theory] by Joshua Grochow * [https://mathoverflow.net/~~questions~~q/277408~~/what-~~ What are- the- current- breakthroughs- of~~-geometric-complexity-theory~~ Geometric Complexity Theory?] * https://mathoverflow.net/questions/243011/why-should-algebraic-geometers-and-representation-theorists-care-about-geometric/ [[Category:Computational complexity theory]]