Garey and Johnson

Garey and Johnson are authors associated with the landmark text "Computers and Intractability", a foundational work in theoretical computer science that established rigorous study of NP-completeness and computational intractability. The duo’s influence extends across algorithm design, complexity theory, discrete mathematics, and practical problem classification, affecting research at institutions like MIT, Stanford University, Princeton University, Harvard University, and Bell Labs. Their work connected notions from pioneers such as Stephen Cook, Richard Karp, Alan Turing, John von Neumann, and Alonzo Church to applications in areas associated with IBM, Microsoft Research, AT&T Bell Laboratories, DARPA, and NSF.

Introduction

"Computers and Intractability" framed a rigorous approach to classifying decision problems, drawing attention to central results like Cook's theorem, Karp's 21 NP-complete problems, and complexity classes such as P (complexity), NP (complexity), co-NP, PSPACE, EXPTIME, RP (complexity), BPP. The text synthesized earlier contributions by researchers at Bell Labs, University of California, Berkeley, Carnegie Mellon University, Caltech, and Cornell University, and catalyzed subsequent work at conferences such as STOC, FOCS, ICALP, SODA, ICALP, and COLT.

Backgrounds and Careers

Each author came from academic and industrial milieus that intersected with figures like Donald Knuth, Edsger W. Dijkstra, E. W. Dijkstra, Claude Shannon, Marvin Minsky, Norbert Wiener, Robert Tarjan, Michael Rabin, Dana Scott, Leslie Valiant, Jack Edmonds, John Hopcroft, and Jeffrey Ullman. Their careers touched departments and centers including University of California, Los Angeles, University of Toronto, University of Washington, University of Illinois Urbana-Champaign, Columbia University, New York University, University of Chicago, Yale University, and laboratories such as Xerox PARC. Interactions with awardees like John McCarthy, Stephen Wolfram, Leslie Lamport, and Edmund Clarke influenced pedagogy and curriculum at institutions including Imperial College London, ETH Zurich, University of Oxford, University of Cambridge, and Seoul National University.

The Book: "Computers and Intractability"

The book consolidated reductions and completeness proofs building on techniques exemplified by SAT (Boolean satisfiability problem), 3-SAT, Hamiltonian cycle problem, Clique problem, Vertex cover, Subset sum problem, Partition problem, Graph coloring, Independent set problem, and Traveling Salesman Problem. It systematized proof strategies used in later work by researchers at Rutgers University, Brown University, Northwestern University, Duke University, University of Maryland, Pennsylvania State University, Ohio State University, Purdue University, and Rice University. The exposition connected to practical domains handled by Bellcore, Siemens, Motorola, Intel, Nokia, and Ericsson, and influenced algorithmic tools used in software from Oracle Corporation, SAP SE, Adobe Systems, Google, Facebook, and Amazon.

Contributions to Computational Complexity

Their presentation clarified reductions between canonical problems such as 3-SAT to Clique problem, Hamiltonian path to Traveling Salesman Problem, Subset sum to Partition problem, and many others used in complexity compendia and handbooks curated by entities like ACM, IEEE, SIAM, Springer, and Elsevier. The framework advanced classification schemas later employed by researchers working on cryptographic assumptions associated with RSA (cryptosystem), Diffie–Hellman key exchange, Elliptic-curve cryptography, and hardness assumptions linked to NP-hardness and NP-completeness used in protocols studied at NIST and IETF. The book’s methodology underpins work by theorists such as Oded Goldreich, Silvio Micali, Shafi Goldwasser, Ronald Rivest, Adi Shamir, Leonard Adleman, Mihalis Yannakakis, Umesh Vazirani, Vitali Milner, and László Babai.

Impact and Legacy

The influence permeates modern research agendas at labs and universities that host projects on approximation algorithms, parameterized complexity, fixed-parameter tractability (FPT), and probabilistically checkable proofs (PCP) by groups at ETH Zurich, MPI (Max Planck Institute), Weizmann Institute of Science, Universidad de Buenos Aires, University of Tokyo, Tsinghua University, Peking University, and National University of Singapore. The work shaped curricula for courses taught at Massachusetts Institute of Technology, Stanford University, University of California, Berkeley, Carnegie Mellon University, Princeton University, and influenced awards and recognition like the Gödel Prize, Turing Award, Knuth Prize, Nevalinna Prize, and Fields Medal-adjacent computational honors. Its legacy continues in textbooks by authors such as Michael Sipser, Jon Kleinberg, Éva Tardos, David Johnson (computer scientist), Garey (computer scientist), Christos Papadimitriou, Sanjeev Arora, Boaz Barak, and in open problems discussed at CCC (Conference on Computational Complexity), Asiacrypt, Crypto (conference), and Eurocrypt.

Category:Theoretical computer scientists