Geometric complexity theory: Difference between revisions

Revision as of 03:34, 1 June 2013

Revision as of 08:30, 6 October 2013

Line 1:

{{unreferenced|date=October 2013}}

'''Geometric complexity theory (GCT)''', is a research program in [[computational complexity theory]] proposed by [[Ketan Mulmuley]]. The goal of the program is to answer the most famous open problem in computer science – [[P versus NP problem|whether P = NP]] – by showing that the complexity class [[P (complexity) | P]] is not equal to the complexity class [[NP (complexity) | NP]].