Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
EUR 44,75
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : new.
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 52,17
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : California Books, Miami, FL, Etats-Unis
EUR 57,91
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 57,65
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 51,79
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 56,42
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Edité par Morgan & Claypool, 2023
Vendeur : Books From California, Simi Valley, CA, Etats-Unis
EUR 32,62
Quantité disponible : 1 disponible(s)
Ajouter au panierpaperback. Etat : Very Good.
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 61,59
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Vendeur : moluna, Greven, Allemagne
EUR 61,26
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. KlappentextProfessor 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 ad.
Langue: anglais
Edité par Association For Computing Machinery 6504698 Mai 2023, 2023
ISBN 13 : 9798400707773
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 81,97
Quantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Neuware - 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.