3 ms·
Interesting. It’s giving me a better answer: P vs. NP is a well-known problem in computer science and mathematical complexity theory. P is the class of problem
by layer8 4y ago
Interesting. It’s giving me a better answer:
P vs. NP is a well-known problem in computer science and mathematical complexity theory. P is the class of problems that can be solved quickly by a computer, while NP is the class of problems for which a solution can be verified quickly by a computer. The question of whether P equals NP is one of the most important open problems in computer science. Many experts believe that P does not equal NP, but this remains unproven.
With your answer, I’d have asked it for an example of a problem that can be solved in polynomial time but cannot be solved in nondeterministic polynomial time.