Why is the term 'reduce' used in the context of NP complexity?
Complexity of subset sum with multiple targets
An algorithm to prove that for a constant K, K-Clique in P?
Trying to proof NP-completeness
In a reduction with additive but nonlinear blow up can I still get APX-Hardness?
Computational Complexity of SIFT descriptor?
Time Complexity Dijkstra
TSP vs. Word Unscrambler
If a deterministic Turing Machine decides a language L, does it mean that it also decides L's complement?
Calculating complexities of both time and space
A little help finding the complexity of time and and complexity of space
Is the Reduction function a correspondence?
3SAT solved in polynomial time?
Finding roots in multiply rooted graphs
Kolmogorov complexity is uncomputable using reductions
Max Flow and NP, Need some Experts Verify this challenge?