NP, Medical Dictionary & A Place to Bury Strangers links for 2008-12-02

What are P, NP-Complete, and NP-Hard? | Explorations We start with the idea of a decision problem, a problem for which an algorithm can always answer “yes” or “no.” We also need the idea of two models of computer (Turing machine, really): deterministic and non-deterministic. A deterministic computer is the regular computer we always thinking […]

Also tagged , , ,