P (complexity)
Notable problems in P

P is known to contain many natural problems, including the decision versions of linear programming, and finding a maximum matching. In 2002, it was shown that the problem of determining if a number is prime is in P. The related class of function problems is FP.

Several natural problems are complete for P, including st -connectivity (or reachability) on alternating graphs. The article on P-complete problems lists further relevant problems in P.
change_case:capital_word_frequency[9], oulipo:avoid_letter[e]