Artículos relacionados a Logic, Automata, and Computational Complexity: The...
Logic, Automata, and Computational Complexity: The Works of Stephen a. Cook (ACM Books) - Tapa blanda
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Acerca del autor
Bruce M. Kapron is a Professor in the Computer Science Department at the University of Victoria. He received his Ph.D. from the University of Toronto, under the supervision of Steve Cook, in 1991. His research interests include complexity theory, computability in higher types, cryptography, and logic. He has been a Fellow of the Institute of Advanced Studies of Alma Mater Studorium―Università di Bologna, a Distinguished Professor of the Fondation Sciences Mathématiques de Paris, and has been a long-term visitor at institutions including Carnegie-Mellon University, Stanford University, the Institute for Advanced Study, and the Simons Institute for the Theory of Computing.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 54,46
EUR 2,28 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoResultados de la búsqueda para Logic, Automata, and Computational Complexity: The...
Imagen del vendedor
Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 46015562-n
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook (Acm Books)
Librería: California Books, Miami, FL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: I-9798400707773
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 46015562
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Logic, Automata, and Computational Complexity
Publicado por
Association of Computing Machinery,U.S., US, 2023
ISBN 13: 9798400707773
Nuevo
Paperback
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: 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 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. Nº de ref. del artículo: LU-9798400707773
Gastos de envío:
GRATIS
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles
Imagen de archivo
Logic, Automata, and Computational Complexity - The Works of Stephen A. Cook
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: FW-9798400707773
Gastos de envío:
EUR 6,75
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 15 disponibles
Imagen de archivo
Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook (Acm Books)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9798400707773_new
Gastos de envío:
EUR 13,77
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Logic, Automata, and Computational Complexity
Publicado por
Association of Computing Machinery,U.S., US, 2023
ISBN 13: 9798400707773
Nuevo
Paperback
Librería: Rarewaves USA, OSWEGO, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: 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 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. Nº de ref. del artículo: LU-9798400707773
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 46015562-n
Gastos de envío:
EUR 17,24
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook (eng)
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
Calificación del vendedor: 5 de 5 estrellas
Condición: new. Nº de ref. del artículo: 1PGWQ5O3XP
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 46015562
Gastos de envío:
EUR 17,24
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles