52.4k views
0 votes
What is P vs NP?? Give an example?

User Trae Moore
by
7.2k points

1 Answer

0 votes

Answer:

P versus NP is the following question of interest to people working with computers and in mathematics: Can every solved problem whose answer can be checked quickly by a computer also be quickly solved by a computer? ... NP problems are fast (and so "easy") for a computer to check, but are not necessarily easy to solve.

Explanation:

User Edwyn
by
7.1k points
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.