Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
no_identd
on April 7, 2019
|
parent
|
context
|
favorite
| on:
Computers without clocks (2002) [pdf]
>every sub-problem is either NP-hard or NP-complete.
Did you check if they're FPT? (Fixed Parameter Tractable)
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
Did you check if they're FPT? (Fixed Parameter Tractable)