Editing P (complexity) (section)

==References==
* {{cite journal
| last = Edmonds | first = Jack | author-link=Jack Edmonds
| year = 1965
| title = Paths, trees, and flowers
| journal = Canadian Journal of Mathematics
| volume = 17
| pages = 449–467
| doi = 10.4153/CJM-1965-045-4}}
* {{Cite book
| last=Cobham | first=Alan | author-link=Alan Cobham (mathematician)
| year = 1965
| chapter = The intrinsic computational difficulty of functions
| title = Logic, Methodology and Philosophy of Science: Proceedings of the 1964 International Congress
| publisher = North Holland
| place = Amsterdam
| editor-last1 = Bar-Hillel | editor-first1=Yehoshua | editor-link1=Yehoshua Bar-Hillel
| pages = 24–30}}
* {{cite conference
| last = Rabin | first = Michael O. | author-link = Michael O. Rabin
| title = Mathematical theory of automata
| book-title = Mathematical Aspects of Computer Science
| series = Proceedings of Symposia in Applied Mathematics
| volume = 19
| year = 1967
| pages = 153–175
| publisher = American Mathematical Society
| doi = 10.1090/psapm/019}}
* [[Thomas H. Cormen]], [[Charles E. Leiserson]], [[Ronald L. Rivest]], and [[Clifford Stein]]. ''[[Introduction to Algorithms]]'', Second Edition. MIT Press and McGraw–Hill, 2001. {{isbn|0-262-03293-7}}. Section 34.1: Polynomial time, pp.&nbsp;971&ndash;979.
* {{Cite book | last=Papadimitriou | first=Christos H. | author-link=Christos H. Papadimitriou | title=Computational complexity | year=1994 | publisher=Addison–Wesley | location=Reading, Mass.  | isbn=978-0-201-53082-7 }}
* {{Cite book | last=Sipser | first=Michael | author-link=Michael Sipser | title=Introduction to the Theory of Computation, 2nd Edition | year=2006 | publisher=Course Technology Inc | isbn=978-0-534-95097-2}} Section 7.2: The Class P, pp.&nbsp;256&ndash;263;.