Does Reducing P or NP instance to NP-Complete make that instance also NP-Hard?...

If A is NP-complete and if there is a reduction from A to B, does it imply that B is also NP-complet...

Why is TSP NP-hard while the Hamiltonian path NP-complete?...

NP-complete vs NP-hard (why are they unequal?)...

Simple, non-trivial bin-packing instance...

Shortest Path from Node A to B by going through all other Nodes (NP-Hard?)...

DCOS cluster resource allocation is np-hard...

Can we Optimise the travel distance in VRPTW by using only one Vehicle?...

NP-Complete VS NP-Hard...

Return the largest disjoint and contiguous subsets ranging from size 1 to L among N positive numbers...

What do you call the property of a list that describes the degree to which it contains duplicates?...

Minimum cost strongly connected digraph...

Proving NP-Completeness...

example of reduction a polynomial decision to an NP-complete...

Proving NP completeness of optimal path cover...

Is there any NP example that we can get an answer in polynomial time？...

Prove no such algorithm exists...

max-weight k-clique in a complete k-partite graph...

Given n sets of integers, how to maximize the number of non overlapping sets...

Understanding Polynomial TIme Approximation Scheme...

How to solve crossword (NP-Hard)?...

How to find the cheapest combinations from a number of products...

Maximizing the overall sum of K disjoint and contiguous subsets of size L among N positive numbers...

Some inference about NP...

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

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

Single candidate and multiple interviewers?...

who knows algorithm about stones and backpack?...

largest possible rectangle of letters...

Selecting k sub-posets...