The Class P
P is the class of all problems that can be solved in polynomial time on a deterministic computer.
Polynomial means O(nk) for some integer k given a problem of size n.
A deterministic computer makes exactly one choice at any choice point.
All single processor machines and machines with fixed parallelism are deterministic.