Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
gugagore
on July 8, 2021
|
parent
|
context
|
favorite
| on:
Compiling Rust is NP-hard
It's awkward to abbreviate "in polynomial time" as "in P". P is a set of (decision) problems. We don't know that 3-SAT is in P. We don't know that it's not.
To say that a solver is not in P is a type error.
Consider applying for YC's Fall 2025 batch! Applications are open till Aug 4
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
To say that a solver is not in P is a type error.