Algebraic studies for P vs NP

Inspired by Ketan Mulmuley approach to P vs NP, this group is intended for studying abstract algebra from the prospective of computational complexity. Discussions of new algorithms for NP-hard problems formulated algebraically (e.g., max clique as a system of polynomial equations) are also welcome.

English (United States)