The class of all languages which can be recognised by a (deterministic) Turing machine in polynomial running time. This class includes almost all practical algorithms.
Linear programming is a complete problem (language) for this class.