Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
|
from
login
If P vs NP formally independent then NP has very close to poly-time upper bounds
(
technion.ac.il
)
21 points
by
amichail
on Sept 3, 2009
|
past
|
10 comments
Join us for
AI Startup School
this June 16-17 in San Francisco!
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
