P (Polynomial Time Complexity Class)
P is the class of problems which can be solved by algorithms whose run time is bounded by a polynomial.
Parents:
- Complexity theory
Study of the computational resources needed to compute something
P is the class of problems which can be solved by algorithms whose run time is bounded by a polynomial.
Parents:
Study of the computational resources needed to compute something