bio | website | gowers.wordpress.com |
---|---|---|
location | ||
age | ||
visits | member for | 4 years, 6 months |
seen | Mar 16 at 23:40 | |
stats | profile views | 29,462 |
Mathematics professor at Cambridge
Sep 6 |
comment |
A combination of two well-known complexity problems
@Richard Stanley -- that's why I insist that they are both hard, though obviously if graph isomorphism is hard then so are NP-complete problems so I could have just said "assuming that graph isomorphism is hard". |
Sep 5 |
comment |
A combination of two well-known complexity problems
A quick remark: one can of course ask the same question for many other NP-complete problems -- I'd be just as interested, for example, in the same question but with "clique of size m" instead of "Hamilton cycle". |
Sep 5 |
asked | A combination of two well-known complexity problems |
Jul 31 |
awarded | Stellar Question |
Jul 24 |
awarded | Popular Question |
Jun 18 |
awarded | Good Question |
Jun 18 |
awarded | Good Question |
Jun 18 |
awarded | Good Question |
Jun 18 |
awarded | Nice Answer |
Jun 18 |
awarded | Nice Answer |
Jun 18 |
awarded | Nice Question |
Jun 18 |
awarded | Nice Answer |
Jun 18 |
awarded | Nice Question |
Jun 17 |
awarded | Great Question |
Jun 16 |
awarded | Great Question |
Jun 11 |
awarded | Favorite Question |
May 14 |
awarded | Favorite Question |
May 1 |
awarded | Famous Question |
May 1 |
awarded | Nice Question |
Apr 30 |
asked | Finding lots of discrete vectors in fairly general position |