Revision as of 19:56, 11 August 2019 edit Bender235 (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers, Template editors 472,805 edits No edit summary ← Previous edit		Revision as of 21:31, 27 September 2019 edit undo PedjaNbg (talk \| contribs) Extended confirmed users 9,060 edits Added free to read link in citations with OAbot #oabot Tag: OAbot [1.0] Next edit →
Line 11: \| title = The Status of the P Versus NP Problem \| volume = 52 \| year = 2009}}\| citeseerx = 10.~~</ref>~~1.1.156.767 }}.</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\|issn=0004-5411}}</ref>

Geometric complexity theory: Difference between revisions