NP Complete Library

A library of NP-Complete problems and how they are proven to be NP-Complete

If you are a student taking a theoretical computer science course, or simply an enthusiast of NP-Complete problems, then you have found the right app! In NP-Complete Library, each entry contains the following information: A brief, simple description of the problem; a formal description of the problem; a proof to why the problem is in NP; a reduction from other NP-Complete problems to the current problem, a listing of other entries that are related to the current problem, and credits. So if you are scratching your head trying to prove something is NP-Complete, you can always come here to look for inspiration!