Geometric complexity theory: Difference between revisions

Revision as of 15:39, 18 August 2018

Latest revision as of 23:58, 19 June 2025

(5 intermediate revisions by 5 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 (JACM)|volume=58|issue=2|pages=5|doi=10.1145/1944345.1944346|s2cid=7703175 |issn=0004-5411|url-access=subscription}}</ref>

== References ==

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]

* [httphttps://cstheory.stackexchange.com/questions/tagged/gct GCT questions] on [[cstheory]]

* [httphttps://cstheory.stackexchange.com/aq/17629 Wikipedia-style explanation of Geometric Complexity Theory] by Joshua Grochow

* [https://mathoverflow.net/questionsq/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]]