Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
usamec
on May 29, 2013
|
parent
|
context
|
favorite
| on:
P might be NP: A Polynomial Time Algorithm for the...
Well, he get proving that his problem is NP-hard right (because the proof is really easy). But his algorithm for solving his problem is really messy and hard to follow.
Consider applying for YC's Fall 2026 batch!
Applications
are open till July 27.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: