Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Scea91
on June 9, 2017
|
parent
|
context
|
favorite
| on:
Optimizing things in the USSR (2016)
> Problems with variables that are constrained to be integer can take much longer, but they are orders of magnitude more efficient today than a few years ago.
Yet, they are still NP-complete.
lorenzhs
on June 9, 2017
|
next
[–]
Doesn't mean that you can't write efficient heuristics that find close-to-optimal or even optimal solutions for a wide variety of practical instances.
merraksh
on June 9, 2017
|
prev
[–]
Indeed. Unless we prove P=NP, technology will only help re-define what "practically solvable" problems are.
Consider applying for YC's Summer 2026 batch! Applications are open till May 4
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
Yet, they are still NP-complete.