Stephen A. Cook

See: Theoretical Computer Scientist, Computational Complexity Theory, Proof Complexity.

References

(Wikipedia, 2014) ⇒ http://en.wikipedia.org/wiki/Stephen_Cook Retrieved:2014-12-7.
- Stephen Arthur Cook, (born December 14, 1939) is a renowned American-Canadian computer scientist and mathematician who has made major contributions to the fields of complexity theory and proof complexity including co-discovering the theory of NP-completeness with Leonid Levin. He is currently a University Professor at the University of Toronto, Department of Computer Science and Department of Mathematics.