Fr. 78.00

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

English · Paperback / Softback

Shipping usually within 3 to 5 weeks (title will be specially ordered)

Description

Read more










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.


Product details

Assisted by Bruce M Kapron (Editor), Bruce M. Kapron (Editor)
Publisher Association for Computing Machinery 6504698
 
Languages English
Product format Paperback / Softback
Released 22.05.2023
 
EAN 9798400707773
ISBN 979-8-4007-0777-3
No. of pages 426
Dimensions 192 mm x 246 mm x 48 mm
Weight 752 g
Series ACM Books
Subject Natural sciences, medicine, IT, technology > IT, data processing > IT

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.