Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
CJefferson
on Jan 6, 2017
|
parent
|
context
|
favorite
| on:
Graph Isomorphism Strikes Back
I'm not clear what you mean -- how else would you prove a problem NP-hard in general? That's usually the most sensible way.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
