Revision as of 12:39, 14 May 2013 edit RDT (talk \| contribs) 295 edits No edit summary ← Previous edit		Revision as of 12:40, 14 May 2013 edit undo RDT (talk \| contribs) 295 edits No edit summary Next edit →
Line 5: The approach is often considered the only viable currently active program to separate [[P (complexity) \| P]] from [[NP (complexity) \| NP]]. However, according to Mulmuley the program is likely to take hundreds of years before it can settle the [[P vs. NP]] problem. 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 ~~argument~~existence of arguments for the program avoiding all known [[barriers (complexity) \| barriers]] for proving general lower-bounds. == External links ==

Geometric complexity theory: Difference between revisions