Logic, Automata, and Computational Complexity

Logic, Automata, and Computational Complexity
Author :
Publisher : Morgan & Claypool
Total Pages : 424
Release :
ISBN-10 : 9798400707803
ISBN-13 :
Rating : 4/5 ( Downloads)

Book Synopsis Logic, Automata, and Computational Complexity by : Bruce M. Kapron

Download or read book Logic, Automata, and Computational Complexity written by Bruce M. Kapron and published by Morgan & Claypool. This book was released on 2023-05-22 with total page 424 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.

Logic, Automata, and Computational Complexity Related Books

Logic, Automata, and Computational Complexity
Language: en
Pages: 424
Authors: Bruce M. Kapron
Categories: Computers
Type: BOOK - Published: 2023-05-22 - Publisher: Morgan & Claypool

GET EBOOK

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 o
Computational Complexity
Language: en
Pages: 609
Authors: Sanjeev Arora
Categories: Computers
Type: BOOK - Published: 2009-04-20 - Publisher: Cambridge University Press

GET EBOOK

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
Automata, Computability and Complexity
Language: en
Pages: 1120
Authors: Elaine Rich
Categories: Computers
Type: BOOK - Published: 2008 - Publisher: Prentice Hall

GET EBOOK

For upper level courses on Automata. Combining classic theory with unique applications, this crisp narrative is supported by abundant examples and clarifies key
Time & Logic
Language: en
Pages: 250
Authors: Leonard Bolc
Categories: Philosophy
Type: BOOK - Published: 2019-10-24 - Publisher: Routledge

GET EBOOK

Originally published in 1995 Time and Logic examines understanding and application of temporal logic, presented in computational terms. The emphasis in the book
Introduction to the Theory of Computation
Language: en
Pages: 437
Authors: Michael Sipser
Categories: Computational complexity
Type: BOOK - Published: 2006 - Publisher: Thomson/Course Technology

GET EBOOK

"Intended as an upper-level undergraduate or introductory graduate text in computer science theory," this book lucidly covers the key concepts and theorems of t