what is NP complete probelm
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
.In computational complexity theory, a problem is NP-complete when: A nondeterministic Turing machine can solve it in polynomial-time. A deterministic Turing machine can solve it in large time complexity classes and can verify its solutions in polynomial time
Answer:
mibinumk ubkbhuk
yvfgyyoyft
Explanation:
huvhbyvftigivuvihihouigugugyihi7hvffv7jununybrfih45ty