Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
mdxn
on Dec 11, 2012
|
parent
|
context
|
favorite
| on:
Jun Fukuyama's P≠NP Page
No, he is claiming that l-CLIQUE requires exponential circuit size (this is the reason that most of the proof talks about circuit complexity and not time bounded Turing Machines). This is not necessarily the same thing as exponential time.
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: