
 Polynomial time  Wikipedia, the free encyclopedia 
  In computational complexity theory, polynomial time refers to the computation time of a problem where the time, m(n), is no greater than a polynomial function of the problem size, n. 
  Mathematicians sometimes use the notion of "polynomial time on the length of the input" as a definition of a "fast" computation, as opposed to "superpolynomial time", which is anything slower than that. 
  Polynomial time is the smallest timecomplexity class on a deterministic machine which is robust in terms of machine model changes, and is the smallest class closed under composition of subproblems. 
 en.wikipedia.org /wiki/Polynomial_time (259 words) 
