Michael R. Garey is a computer science researcher, and co-author (with David S. Johnson) of Computers and Intractibility: A Guide to the Theory of NP-completeness. Wikibooks has more about this subject: Wikiversity Riverside Graphics Lab Open Directory Project: Computer Science Collection of Computer Science Bibliographies Belief that title science in computer science is inappropriate Categories: Computer science | Academic disciplines ... David S. Johnson (born December 9, 1945) is a computer scientist specializing in algorithms and optimization. ... In complexity theory, the NP-complete problems are the most difficult problems in NP, in the sense that they are the ones most likely not to be in P. The reason is that if you could find a way to solve an NP-complete problem quickly, then you could use...

Garey's personal web page (http://cm.bell-labs.com/cm/ms/former/mrg/bio.html)