P (Polynomial Time Complexity Class)

P is the class of prob­lems which can be solved by al­gorithms whose run time is bounded by a polyno­mial.

Parents:

  • Complexity theory

    Study of the com­pu­ta­tional re­sources needed to com­pute something