Jump to content

Geometric complexity theory

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Azotlichid (talk | contribs) at 20:37, 13 May 2013 (Created page with 'Geometric Complexity Theory seeks to address fundamental complexity lower bound questions such as P versus NP by means of algebraic geometry and representation t...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Geometric Complexity Theory seeks to address fundamental complexity lower bound questions such as P versus NP by means of algebraic geometry and representation theory.