Day: Sunday March 26, 2006

A SET OF HARD PROBLEMS

The theory of computation studies a class of problems called ‘NP Complete.’ These are problems that are considered computationally hard in the sense that all known algorithms to solve them require a non-deterministic Turing machine polynomial orders of time. The… Read More ›