What does this sentence mean "It is NP-hard to approximate the Max-3-DM with bound 2 "?...

Class Scheduling to Boolean satisfiability [Polynomial-time reduction] part 2...

Constrained Knapsack without weight...

Is the complement of the language CLIQUE element of NP?...

Why do we get to pick the source in an NP-completeness reduction?...

Complexity of subset sum with multiple targets...

Efficient scheduling jobs with declining profits on multiple machines...

Subset sum solution length...

Verification algorithm for minimum vertex cover?...

Prove NP-Completeness of generating 2 shortest routes over given edge grouping constraints?...

Prove NP-completeness of CLIQUE-OR-INDEPENDENT-SET...

Algorithm/approximation for combined independent set/hamming distance...

NP complete or NP hard, in a equivalences problems?...

How is 2-CNF SAT is in P, while 3-CNF SAT is in NPC?...

Counting Subgraph Instances...

How to match a set against a set of sets, completely...

NP and 3-SAT and One Facts...

Numberlink/Flow Game: How to spot NP-Complete problems?...

Can it be proven no polynomial algorithm exists for an NP-Complete prob.?...

Bin Packing regarding Optimization and Decision Versions...

Finding vertices of a maximum clique in polynomial time...

Given k-coloring of graph's vertices calculate (k-1)-coloring...

Tricky programming problem that I'm having trouble getting my head around...

Cook's Theorem (in plain English)...

How to assign N numbers into M pack that minimize some target function?...

Is it possible to use Dijkstra's Shortest Path Algorithm to find the shortest Hamiltonian path? ...

Approximation Algorithm between two NP compete problems...

Partitioning a list of integers to minimize difference of their sums...

Prove that any minimum vertex cover of a clique of size n must have exactly n-1 vertices...

Why does the formal procedure prove NP-Completeness?...