| Algebraic studies for P vs NP |
| alt.news-media |
| bmastn |
| Chromium-dev |
| Cloud Computing Use Cases |
| Free Pornstar DVD Movies and Videos |
| gtqhc9 |
| kgsggsulim56814 |
| limr 4 |
| qcusva |
| qw9u |
| svkx36 |
| u8bwg |
| upv5 |
| World Book Fair |
| [clear] |
|
|
| Members: 1 |
|
Group categories:
|
| More group info » |
Last updated by Stas Busygin -
May 1
- 1 author
- 1 page long
|
|
| Create a group - Google Groups - Google Home - Terms of Service - Privacy Policy |
| ©2009 Google |
|
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.
