Newbetuts
.
New posts in np-complete
Solving the NP-complete problem in XKCD
language-agnostic
np-complete
A graph problem
graph-theory
optimization
algorithms
computer-science
np-complete
Is it possible that P != NP cannot be proved?
logic
computer-science
np-complete
Assuming $P \neq NP$, do we know whether there are problems which are in $NP$, not in $P$ and are not $NP$ complete?
computer-science
np-complete
How would you input xkcd.com/287 into WolframAlpha?
combinatorics
np-complete
wolfram-alpha
popular-math
Is finding the length of the shortest addition chain for a number $n$ really $NP$-hard?
combinatorics
reference-request
np-complete
Example of a problem that is NP-Hard but not NP-Complete
np-complete
The practical implication of P vs NP problem
computer-science
np-complete
Algorithm to find which numbers from a list of size n sum to another number
c#
algorithm
math
np-complete
Must an algorithm that decides a problem in NP also produce a solution?
computational-complexity
np-complete
What are NP-complete problems and why are they so important?
computer-science
np-complete
What is the complexity of succinct (binary) Nurikabe?
computer-science
puzzle
np-complete
computational-complexity
Solving SAT by converting to disjunctive normal form
algorithms
propositional-calculus
alternative-proof
np-complete
satisfiability
Why are there only a few known Ramsey numbers?
combinatorics
np-complete
ramsey-theory
Simple "real life" NP-hard problems?
computer-science
np-complete
What's "P=NP?", and why is it such a famous question? [closed]
computer-science
theory
complexity-theory
np-complete
p-np
What is the $3$-SAT problem? [closed]
computer-science
computational-complexity
np-complete
What is an NP-complete in computer science?
algorithm
language-agnostic
mathematical-optimization
theory
np-complete
What are the differences between NP, NP-Complete and NP-Hard?
computer-science
complexity-theory
np
np-complete
np-hard
Prev