Is a reduction enough for proving NP-complete or do I need a transformation?...

Effect of number base when proving NP completeness of numerical problems...

Np-hardness reduction...

Reducing from Vertex Cover to prove NP-complete...

Reduction algorithm from the Hamiltonian cycle...

assignment problem with costs...

How to reduce 3COLOR to 3SAT?...

proof NP-complete...

List of problems that are in general NP-hard but have polynomial-time solution in planar graphs?...

What is the difference between a 'combinatorial algorithm' and a 'linear algorithm'?...

Looking for a model to represent this problem, which I suspect may be NP-complete...

Polynomial time algorithm for finding a Hamiltonian walk in a graph...

A very complex problem in reduction notion...

Factorial-time algorithms and P/NP...

Minimum Bandwidth Problem...

Have you ever had a business requirement that turned out to be an NP-Complete problem?...

Possible NP-complete problem?...

Is this an NP problem?...

Best-case Running-time to solve an NP-Complete problem?...

Find set of numbers in one collection that adds up to a number in another...

Is this problem np-complete?...

Where does optical character recognition (OCR) fall on the scale of problem difficulty?...

Is this problem NP, and does it have a name?...

Simple reduction (NP completeness)...

The subsets-sum problem and the solvability of NP-complete problems...

Is it correct to ask to solve an NP-complete problem on a job interview?...

Need Algorithm to group files of varying sizes into approximately equal blocks...

Is this "Valid mathematical expression" problem P, or NP?...

how were the first NP-complete problems shown to be NP-complete?...

What is a good algorithm for compacting records in a blocked file?...