|
|
|
|
|
|
by Vervious
488 days ago
|
|
|
how do you know if an instance you picked is hard? Another problem with your suggestion: Do we even know that a 1/polynomial sized fraction of 3-coloring instances are hard? (Else you'll never sample one). (NP-Hardness certainly does not give such a guarantee, even though it sounds weak) |
|
|