Jump to content

Geometric complexity theory

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by הסרפד (talk | contribs) at 22:50, 13 May 2013 (הסרפד moved page Geometric Complexity Theory to Geometric complexity theory: Unnecessary capitalization). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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