Complexity measurement of NP-complete...

NP complete - solvable in non-deterministic polynomial time...

Is this a correct understanding of proving something is NP Complete?...

NP problems can be solved in deterministically EXPONENTIAL time?...

Java: Traveling Salesman - Found polynomial algorithm...

Is this variant of the subset sum problem easier to solve?...

Comparing syntax trees modulo alpha conversion...

PartitionProblem - find the optimal subsets...

Divide list into two equal parts algorithm...

Question about NP-Completeness of the Independent Set Problem...

NP-complete, no efficient algorithm?...

Where to find a set of hard Traveling Salesman Problems (with known solutions/approximations)?...

Is the board game "Go" NP complete?...

Double exponential problems?...

Is it necessary for NP problems to be decision problems ?...

Hamiltonian paths & social graph algorithm...

NP hard but not NPC...

Dynamic Programming for TSP...

When NP complete becomes NP hard...

Solving an extension of the Shortest Hamiltonian Path...

graph coloring and NP completeness...

bin packing with overlapping objects...

2D Bin Packing with Multiple Size Bins...

Solving the NP-complete problem in XKCD...

How to find what numbers in a set add up to another given number?...

Find the best combination from a given set of multiple sets...

Is the 0-1 Knapsack that each item has the same weight NP-complete?...

minimal multiplications vs a set-cover issue...

Subset Inference NP-complete?...

reducing to np hard...