Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook - Paperback
$50.99
$51.45
-1%Quantity
01
Pay over time for orders over $35.00 with
Availability:In StockContributor:Bruce M. Kapron (Editor)Series:ACM BooksPublish date:2023-05-22Pages:426
Language:EnglishPublisher:Association for Computing MachineryISBN-13:9798400707773UPC:9798400707773Book Category:Computers, MathematicsBook Subcategory:Computer Science, Information Theory, Discrete MathematicsSize:9.25 x 7.50 x 0.87 inchesWeight:1.6006Product ID:SCE39SDV8V
Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook
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...
Series: ACM Books
Language:EnglishPublisher:Association for Computing MachineryISBN-13:9798400707773UPC:9798400707773Book Category:Computers, MathematicsBook Subcategory:Computer Science, Information Theory, Discrete MathematicsSize:9.25 x 7.50 x 0.87 inchesWeight:1.6006Product ID:SCE39SDV8V
Publisher: Association for Computing Machinery
Contributor(s)
Free shipping on orders over $75. Standard shipping takes 3-7 business days. Returns accepted within 30 days of purchase.