List of NP-complete problems
From Wikipedia, the free encyclopedia
This is a list of some of the more commonly known problems that are NP-complete when expressed as decision problems. As there are hundreds of such problems known, this list is in no way comprehensive. Many problems of this type can be found in Garey & Johnson (1979).
This is a dynamic list and may never be able to satisfy particular standards for completeness. You can help by adding missing items with reliable sources.