Stephen A. Cook
Recipient of the 1982 ACM Turing Award for "contributions to the Theory of Computational Complexity, including the concept of nondeterministic, polynomial-time completeness."
A description of Cook and his work can be found on the ACM Turing Award website here. (MRW, 2012)
New content Copyright © 2013-2019 by the IEEE Computer Society and the Institute of Electrical and Electronics Engineers Inc.
All rights reserved. This material may not be reproduced or redistributed without the express written permission of the copyright holder.