Logic Automata Computational Complexity (17 results)
- Softcover
Seller: Brook Bookstore On Demand, Napoli, NA, ItalyBrook Bookstore On Demand
Contact seller5-star sellerCondition: New
US$ 51.83
US$ 7.75 shippingShips from Italy to U.S.A.Quantity: Over 20 available
Condition: new.
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
US$ 56.93
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: Rarewaves.com USA, London, LONDO, United KingdomRarewaves.com USA
Contact seller5-star sellerCondition: New
US$ 61.10
Free ShippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: New. 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 pr…ofound 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.
- Softcover
Seller: PBShop.store UK, Fairford, GLOS, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: New
US$ 55.58
US$ 7.75 shippingShips from United Kingdom to U.S.A.Quantity: 15 available
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
- Softcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller4-star sellerCondition: New
US$ 64.00
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
US$ 63.43
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
- Softcover
Seller: Rarewaves USA, OSWEGO, IL, U.S.A.Rarewaves USA
Contact seller5-star sellerCondition: New
US$ 73.65
Free ShippingShips within U.S.A.Quantity: Over 20 available
Paperback. Condition: New. 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 pr…ofound 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.
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
US$ 58.29
US$ 19.80 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 63.50
US$ 15.81 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Hardcover
Seller: PBShop.store UK, Fairford, GLOS, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: New
US$ 72.90
US$ 8.92 shippingShips from United Kingdom to U.S.A.Quantity: 15 available
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
Published by Morgan & Claypool 2023
- Softcover
Seller: Books From California, Simi Valley, CA, U.S.A.Books From California
Contact seller4-star sellerCondition: Used - Very good
US$ 36.05
US$ 4.99 shippingShips within U.S.A.Quantity: 1 available
paperback. Condition: Very Good.
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
US$ 69.35
US$ 19.80 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
- Softcover
Seller: Rarewaves USA United, OSWEGO, IL, U.S.A.Rarewaves USA United
Contact seller5-star sellerCondition: New
US$ 78.26
US$ 50.00 shippingShips within U.S.A.Quantity: Over 20 available
Paperback. Condition: New. 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 pr…ofound 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.
- Softcover
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
US$ 74.28
US$ 55.81 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: 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.
- Softcover
Seller: Rarewaves.com UK, London, United KingdomRarewaves.com UK
Contact seller5-star sellerCondition: New
US$ 58.30
US$ 85.79 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: New. 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 pr…ofound 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.
Language: English
Published by Association For Computing Machinery 6504698 Mai 2023 2023
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 91.94
US$ 72.63 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: 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 signif…icant 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.
- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 147.02
US$ 79.74 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Computability | Computability theory, Computer science, Mathematical logic, Turing machine, Automata theory, Hypercomputation, Computational complexity theory, Parallel computing, Halting problem | Frederic P. Miller (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130205133 | Verantw…ortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.
