Logic, Automata, and Computational Complexity

The Works of Stephen A. Cook
Herausgeber: Kapron, Bruce M

• Broschiertes Buch

Produktbeschreibung

Professor Stephen A. Cook is a pioneer of the theory of computational complexity. Cook won the 1982 Turing Award for ""his advancement of our understanding of the complexity of computation in a significant and profound way."" This volume includes a selection of seminal papers embodying the work that led to this award.

Produktdetails

• Verlag: Association for Computing Machinery 6504698
• Seitenzahl: 426
• Erscheinungstermin: 22. Mai 2023
• Englisch
• Abmessung: 246mm x 192mm x 48mm
• Gewicht: 752g
• ISBN-13: 9798400707773
• Artikelnr.: 68174982

Autorenporträt

Bruce M. Kapron is a Professor in the Computer Science Department at the University of Victoria. He received his Ph.D. from the University of Toronto, under the supervision of Steve Cook, in 1991. His research interests include complexity theory, computability in higher types, cryptography, and logic. He has been a Fellow of the Institute of Advanced Studies of Alma Mater Studorium—Università di Bologna, a Distinguished Professor of the Fondation Sciences Mathématiques de Paris, and has been a long-term visitor at institutions including Carnegie-Mellon University, Stanford University, the Institute for Advanced Study, and the Simons Institute for the Theory of Computing.