Re:NP-hard does not mean hard (2017)
by globular-toast on Thursday August 17, 2023 @03:36AM
(#37158417)
This is similar to Knuth's reasoning for P=NP. Essentially there might be algorithms for these problems that are simply so complex that we might never know them.
[ Parent
| on HN ]
There are no comments on this comment yet.