Category:NP-complete problems

From Wikipedia, the free encyclopedia

You have new messages (last change).

The main article for this category is NP-complete problems.

Subcategories

There are 2 subcategories to this category shown below (more may be shown on subsequent pages).

S

Pages in category "NP-complete problems"

There are 55 pages in this section of this category.

3

3-partition problem

B

C

D

E

Exact cover

F

G

H

H cont.

Hitting set

I

Independent set problem

J

Job-shop problem

K

L

M

N

O

One-in-three 3SAT

P

Q

S

T

U

Unit disk graph

V

Retrieved from "http://en.wikipedia.org../../../n/p/-/Category%7ENP-complete_problems_d7a2.html"

Category: Computational problems

Views

interaction

Search

In other languages