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 Scea91 on Wednesday July 22, 2015 @08:28AM (#9929161)
Polynomial complexity doesn't necessarily mean efficient if the polynom is of a high order.
[ Parent | on HN ]
Re:A Polynomial Time Bounded-Error Quantum Algorithm for Boo... by amalcon on Wednesday July 22, 2015 @08:31AM (#9929169)
That is true and worth remembering if you're a theoretical computer scientist, but we're trying to simplify here.
[ Parent | on HN ]