Bruce kapron (15 Ergebnisse)
- Softcover
Anbieter: Brook Bookstore On Demand, Napoli, ItalienBrook Bookstore On Demand
Verkäufer/-in kontaktierenVerkäufer/-in mit 3 SternenZustand: Neu
EUR 44,08
EUR 6,80 VersandVersand von Italien nach USAAnzahl: Mehr als 20 verfügbar
Zustand: new.
- Softcover
Anbieter: GreatBookPrices, Columbia, USAGreatBookPrices
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 51,41
EUR 2,29 VersandVersand innerhalb von USAAnzahl: Mehr als 20 verfügbar
Zustand: New.
- Softcover
Anbieter: Rarewaves.com USA, London, Vereinigtes KönigreichRarewaves.com USA
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 55,42
Versand nach gratisVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Paperback. Zustand: 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 prof…ound 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
Anbieter: PBShop.store UK, Fairford, Vereinigtes KönigreichPBShop.store UK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 48,76
EUR 6,80 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 15 verfügbar
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
- Softcover
Anbieter: California Books, Miami, USACalifornia Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 57,21
Versand nach gratisVersand innerhalb von USAAnzahl: Mehr als 20 verfügbar
Zustand: New.
- Softcover
Anbieter: GreatBookPrices, Columbia, USAGreatBookPrices
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Wie neu
EUR 56,70
EUR 2,29 VersandVersand innerhalb von USAAnzahl: Mehr als 20 verfügbar
Zustand: As New. Unread book in perfect condition.
- Softcover
Anbieter: Rarewaves USA, OSWEGO, USARarewaves USA
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 65,84
Versand nach gratisVersand innerhalb von USAAnzahl: Mehr als 20 verfügbar
Paperback. Zustand: 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 prof…ound 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
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes KönigreichGreatBookPricesUK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 51,13
EUR 17,37 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New.
- Softcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 55,70
EUR 13,87 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
- Hardcover
Anbieter: PBShop.store UK, Fairford, Vereinigtes KönigreichPBShop.store UK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 63,95
EUR 7,83 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 15 verfügbar
HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
- Softcover
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes KönigreichGreatBookPricesUK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Wie neu
EUR 60,81
EUR 17,37 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: As New. Unread book in perfect condition.
- Softcover
Anbieter: Rarewaves USA United, OSWEGO, USARarewaves USA United
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 67,63
EUR 43,39 VersandVersand innerhalb von USAAnzahl: Mehr als 20 verfügbar
Paperback. Zustand: 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 prof…ound 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
Anbieter: moluna, Greven, Deutschlandmoluna
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 63,31
EUR 48,99 VersandVersand von Deutschland nach USAAnzahl: Mehr als 20 verfügbar
Zustand: 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
Anbieter: Rarewaves.com UK, London, Vereinigtes KönigreichRarewaves.com UK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 51,14
EUR 75,26 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Paperback. Zustand: 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 prof…ound 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
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 78,36
EUR 63,76 VersandVersand von Deutschland nach USAAnzahl: 2 verfügbar
Taschenbuch. Zustand: 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 signific…ant 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.
