News for hackers. Stuff that matters.

A comment on Computers without clocks (2002) [pdf]. Parent comment

Re:Computers without clocks (2002) [pdf] by no_identd on Sunday April 07, 2019 @06:03PM (#19600217)
>every sub-problem is either NP-hard or NP-complete.

Did you check if they're FPT? (Fixed Parameter Tractable)

[ Parent | on HN ]

There are no comments on this comment yet.