Geometric Complexity Theory

From SIAG-AG

(Latest | Earliest) View (previous 50) (next 50) (20 | 50 | 100 | 250 | 500).

Diff selection: mark the radio boxes of the versions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with current version, (last) = difference with preceding version, M = minor edit.

• (cur) (last) 05:47, 26 November 2014 Blekherman (Talk | contribs) (New page: Geometric Complexity Theory seeks to address fundamental complexity lower bound questions such as P versus NP by means of algebraic geometry and representation theory. There has recently b...)

(Latest | Earliest) View (previous 50) (next 50) (20 | 50 | 100 | 250 | 500).