Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook


Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook (ACM Books)
by: Bruce M Kapron (Editor)

ASIN: ‎B0C685V8KS
Publisher finelybook 出版社:‏ ‎ACM (May 22, 2023)
Language 语言: ‎English
Print Length 页数: ‎426 pages
ISBN-13: ‎9798400707773

Book Description


Professor Stephen A. Cook is a pioneer of the theory of computational complexity. His work on NP-completeness and the P vs. NP problem remains a central focus of this field. 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, exemplifying Cook’s synthesis of ideas and techniques from logic and the theory of computation including NP-completeness, proof complexity, bounded arithmetic, and parallel and space-bounded computation. These papers are accompanied by contributed articles by leading researchers in these areas, which convey to a general reader the importance of Cook’s ideas and their enduring impact on the research community. The book also contains biographical material, Cook’s Turing Award lecture, and an interview. Together these provide a portrait of Cook as a recognized leader and innovator in mathematics and computer science, as well as a gentle mentor and colleague.
About the Author
Bruce M. Kapron 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. Amazon page

下载地址 Download解决验证以访问链接!
打赏
未经允许不得转载:finelybook » Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook

评论 抢沙发

觉得文章有用就打赏一下

您的打赏,我们将继续给力更多优质内容

支付宝扫一扫

微信扫一扫