Variation of Bin packing- with bin and object classes and mutual constraints...

Is Computationally-hard is same as NP-hard?...

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

Does every language belong to either P or NP?...

Splitting lists of numbers in polynomial time s.t. the products are similar...

Subset sum algorithm a little faster than 2^(n/2) in worst time?...

Is there a graph coloring algorithm where limits can be placed on number of vertices per color...

Algorithm for selecting subset of people who use same stuff NP-hard?...

Filling rectilinear polygon (with holes) with rectangles...

Proving inapproximability for minimum cycle covering...

Why isn't 3-color in P?...

Subgraph isomorphism to SAT...

Shortest cost path...

If P=NP then how we can we say P=NP=NP-complete?...

Polynomial time: Accepting and Decision Algorithms...

Algorithm to find unique set of items, one item from each of a set of sets...

Complexity measurement of NP-complete...

Why P=NP does not imply that halting of Turing machine solvable in polynomial time?...

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

P=NP: What are the most promising methods?...

Is 3-SAT polynomially equivalent to INDEPENDENT-SET...

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

Why is factoring in NP, but not in P?...

Travelling Salesman - approximation online software?...

Does a polynomial time shortest path algorithm exist given that both source and target verteces are ...

Maximum Independent Set Algorithm...

translate approximate algorithm for subset sum into php code...

Multiple TSP with a twist...

Is this NP optimization?...

Why is every instance in P also in NP [verifier-based definition]?...