Complexity - NP - completeness
4 important questions on Complexity - NP - completeness
Explain polynomially reduced (use problem A and B in your explanation)
A =< B
T(X) transforms A to B in polynomial number of steps.
When is a problem NP-complete?
Thus, B is NP-Complete if B is in NP and
A =< B and A is in NP
How do you prove whether a problem is NP-complete (2 steps)
- Prove that the problem is NP
- Prove that a know NP-complete problem can be polynomially reduced to this problem
- Works for a no-answer
- Works for a yes answer
- Reduction done in polynomial time
- Higher grades + faster learning
- Never study anything twice
- 100% sure, 100% understanding
Study polynomially reducable example slide 31 of complexity
The question on the page originate from the summary of the following study material:
- A unique study and practice tool
- Never study anything twice again
- Get the grades you hope for
- 100% sure, 100% understanding
![Trustpilot Logo](/images/design_2020/lp/clp-trustpilot-en.png)