deeshaa.org
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 t…