Significados de complexity class em inglês

A complexity class contains all problems that can be solved within a given resource budget, where the resource is something like time or memory.

Quantum Classes A basic task of theoretical computer science is to sort problems into complexity classes.

Therefore, computer scientists believe (but have not been able to prove) that those two problems belong to different complexity classes.

The two most famous complexity classes are "P" and "NP." P is all the problems that a classical computer can solve quickly.