You are a graduate computer science student who came up with a new brute-force algorithm that can provide an optimal answer to a complex problem. Your advisor asks you to validate if your new algorithm is NP-Complete.
What do you need to do?

Question

You are a graduate computer science student who came up with a new brute-force algorithm that can provide an optimal answer to a complex problem. Your advisor asks you to validate if your new algorithm is NP-Complete.

What do you need to do?

Answer

Try to transform/reduce your algorithm into a 3SAT problem in polynomial time and viceversa

Answer

Prove that you algorithm can be verified in polynomial time.

Answer

Make sure your code has loop invariants on all loops and inductive proof on recursions.

Answer

Try to find a polynomial time solution for the problem

Crowdly

You are a graduate computer science student who came up with a new brute-force ...

Want instant access to all verified answers on online.upr.edu?