News for hackers. Stuff that matters.

A comment on A Polynomial Time Bounded-Error Quantum Algorithm for Boolean Satisfiability. Parent comment

Re:A Polynomial Time Bounded-Error Quantum Algorithm for Boo... by raverbashing on Wednesday July 22, 2015 @09:50AM (#9929613)
Ah true, my mistake, it is not NP-hard but it is in NP

Wikipedia says it's UP https://en.wikipedia.org/wiki/UP_%28complexity%29 (which is contained in NP)

[ Parent | on HN ]

There are no comments on this comment yet.