News for hackers. Stuff that matters.
Re:What P vs. NP is about by bloaf on Saturday October 05, 2024 @10:37PM (#41754330)
For an example of harder-than-np-complete, I was shocked to find out how hard vector reachability is after being presented with a vector reachability problem and assuming I could just look up a reasonable-time algorithm.

I incorrectly assumed it would have some basic linear algebra solution because of how simple the problem seemed.

There are no comments on this comment yet.