Content deleted Content added
No edit summary |
m Open access bot: url-access updated in citation with #oabot. |
||
(26 intermediate revisions by 19 users not shown) | |||
Line 1:
'''Geometric
The idea behind the approach is to adopt and develop advanced tools in [[algebraic geometry]] and [[representation theory]] (i.e., [[geometric invariant theory]]) to prove lower
The approach is
| last = Fortnow | first = Lance
| doi = 10.1145/1562164.1562186
| issue = 9
| journal = Communications of the ACM
| pages = 78–86
| title = The Status of the P Versus NP Problem
| 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
== References ==
{{reflist}}
== Further reading ==
K. D. Mulmuley and M. Sohoni. Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems. SIAM J. Comput. 31(2), 496–526, 2001.
K. D. Mulmuley and M. Sohoni. Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties. SIAM J. Comput., 38(3), 1175–1206, 2008.
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: Efficient algorithms for Noether normalization. J. Amer. Math. Soc. 30 (2017), no. 1, 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.
== External links ==
* [http://gct.cs.uchicago.edu/ GCT page, University of Chicago]
* [http://simons.berkeley.edu/workshop_alggeometry1.html Description on the Simons Institute webpage]
* [
* [https://cstheory.stackexchange.com/q/17629 Wikipedia-style explanation of Geometric Complexity Theory] by Joshua Grochow
* [https://mathoverflow.net/q/277408 What are the current breakthroughs of Geometric Complexity Theory?]
* https://mathoverflow.net/questions/243011/why-should-algebraic-geometers-and-representation-theorists-care-about-geometric/
[[Category:Computational complexity theory]]
|