Exact cover problem but with constraint on exact number of subsets in the solution...

Is Shortest Hamiltonian path NP-hard?...

Is SUDOKU np-complete?...

If P != NP, are there more P than non-P problems or vice versa?...

A smarter function to decide if C is an exact cover of S?...

Understanding Poly-time Reduction/NP-complete...

What's "P=NP?", and why is it such a famous question?...

SAT is NP complete, so why don't we have k-SAT is NP complete for arbitrary value of k...

Why all NP-complete problems can be reducible to 3-SAT?...

Optimal algorithm to count the number of strings a DFA accepts...

Np class of problems...

how to find the least number of operations to compute x^n...

When L2 is NP complete, and L1 can be reduced to L2...

How to delete consecutive elements in a linked list which add up to 0...

Show np-completeness of Disjoint Hamiltonian Path...

Proving PATH problem is not a NP-complete problem...

Is there an NP problem that is not NP-complete or P?...

Minimal addition-chain exponentiation...

Reducing knapsack problem to an inverse knapsack problem...

Algorithm to find which numbers from a list of size n sum to another number...

Proof of NP Completeness of set-partition problem...

Prove that the reduction of HAM-CYCLE to TSP is polynomial-time?...

What is the simplest, easiest algorithm for finding EMST of a complete graph of order 10^5...

Can NP-Intermediate exist if P = NP?...

Prove a problem that is NP-hard and not NP-complete in not in P...

Optimizing a Parking Lot Problem. What algorithms should I use to fit the most amount of cars in the...

Why is chess, checkers, Go, etc. in EXP but conjectured to be in NP?...

Dividing a list of numbers into roughtly equal totals...

Graph Coloring with using Simulated Annealing...

String to string correction problem np-completeness proof...