Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Jweb_Guru
on June 18, 2022
|
parent
|
context
|
favorite
| on:
CreuSAT: Formally verified SAT solver written in R...
The optimization problem isn't, but neither are the optimization problems for a bunch of other NP-complete problems. The decision problem (where you specify an upper bound cost) is indeed NP-complete.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: