Geometric complexity theory: Difference between revisions

Revision as of 15:39, 18 August 2018

Revision as of 23:01, 23 August 2018

Line 13:

| year = 2009}}.</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|issn=0004-5411}}</ref>

== References ==