Content deleted Content added
Added free to read link in citations with OAbot #oabot |
Citation bot (talk | contribs) Add: s2cid. | Use this bot. Report bugs. | Suggested by SemperIocundus | #UCB_webform 926/2500 |
||
Line 12:
| volume = 52
| year = 2009| citeseerx = 10.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}}</ref>
== References ==
| |||