Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Timwi
62 days ago
|
parent
|
context
|
favorite
| on:
Semiclassical Gravity Efficiently Solves NP-Comple...
What non-contrived polynomial time problem can you think of that is n^20? I'm really curious.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: