New posts in np-complete

Solving the NP-complete problem in XKCD

A graph problem

Is it possible that P != NP cannot be proved?

Assuming $P \neq NP$, do we know whether there are problems which are in $NP$, not in $P$ and are not $NP$ complete?

How would you input xkcd.com/287 into WolframAlpha?

Is finding the length of the shortest addition chain for a number $n$ really $NP$-hard?

Example of a problem that is NP-Hard but not NP-Complete

The practical implication of P vs NP problem

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

Must an algorithm that decides a problem in NP also produce a solution?

What are NP-complete problems and why are they so important?

What is the complexity of succinct (binary) Nurikabe?

Solving SAT by converting to disjunctive normal form

Why are there only a few known Ramsey numbers?

Simple "real life" NP-hard problems?

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

What is the $3$-SAT problem? [closed]

What is an NP-complete in computer science?

What are the differences between NP, NP-Complete and NP-Hard?