Polynomial-time combinatorial operators are polynomials
John Newsome Crossley, Jeffrey B. Remmel · Birkhäuser Boston eBooks · 1990
Feasible mathematics has been identified with polynomial-time computations for at least the last two decades. Its study has been a natural development from existing mathematics under the influence of computer science. The earlier part of this century saw a move to constructivist logic and this has now led to the further increase of precision from functions computable-in-principle to polynomial-time computable functions (p-time functions, for short).