Computability and Complexity Theory
Alan L. Selman (u. a.)
ISBN 10: 1489989714 ISBN 13: 9781489989710
Editorial: Springer, 2014
Nuevos
Taschenbuch
Librería:
preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Vendedor de AbeBooks desde 5 de agosto de 2024
Este artículo en concreto ya no está disponible.
Descripción
Descripción:
Computability and Complexity Theory | Alan L. Selman (u. a.) | Taschenbuch | xvi | Englisch | 2014 | Springer | EAN 9781489989710 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. N° de ref. del artículo 105417938
Sinopsis:
This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations. Subsequent chapters move from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability, NP-completeness, and relative computability focus on the limitations of computability and the distinctions between feasible and intractable. Substantial new content in this edition includes:
- a chapter on nonuniformity studying Boolean circuits, advice classes and the important result of Karp─Lipton.
- a chapter studying properties of the fundamental probabilistic complexity classes
- a study of the alternating Turing machine and uniform circuit classes.
- an introduction of counting classes, proving the famous results of Valiant and Vazirani and of Toda
- a thorough treatment of the proof that IP is identical to PSPACE
With its accessibility and well-devised organization, this text/reference is an excellent resource and guide for those looking to develop a solid grounding in the theory of computing. Beginning graduates, advanced undergraduates, and professionals involved in theoretical computer science, complexity theory, and computability will find the book an essential andpractical learning tool.
Topics and features:
- Concise, focused materials cover the most fundamental concepts and results in the field of modern complexity theory, including the theory of NP-completeness, NP-hardness, the polynomial hierarchy, and complete problems for other complexity classes
- Contains information that otherwise exists only in research literature and presents it in a unified, simplified manner
- Provides key mathematical background information, including sections on logic and number theory and algebra
- Supported by numerous exercises and supplementary problems for reinforcement and self-study purposes
Acerca del autor: Charlotte y Peter Fiell son dos autoridades en historia, teoría y crítica del diseño y han escrito más de sesenta libros sobre la materia, muchos de los cuales se han convertido en éxitos de ventas. También han impartido conferencias y cursos como profesores invitados, han comisariado exposiciones y asesorado a fabricantes, museos, salas de subastas y grandes coleccionistas privados de todo el mundo. Los Fiell han escrito numerosos libros para TASCHEN, entre los que se incluyen 1000 Chairs, Diseño del siglo XX, El diseño industrial de la A a la Z, Scandinavian Design y Diseño del siglo XXI.
"Sobre este título" puede pertenecer a otra edición de este libro.
Detalles bibliográficos
Título: Computability and Complexity Theory
Editorial: Springer
Año de publicación: 2014
Encuadernación: Taschenbuch
Condición: Neu
Edición: 2ª Edición
Los mejores resultados en AbeBooks
Imagen del vendedor
Computability and Complexity Theory
Publicado por
Springer US, 2014
ISBN 10: 1489989714
ISBN 13: 9781489989710
Nuevo
Kartoniert / Broschiert
Librería: moluna, Greven, Alemania
Calificación del vendedor: 4 de 5 estrellas
Kartoniert / Broschiert. Condición: New. Nº de ref. del artículo: 4213043
Comprar nuevo
EUR 79,10
Gastos de envío:
EUR 48,99
De Alemania a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Computability and Complexity Theory (Texts in Computer Science)
Librería: Best Price, Torrance, CA, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. SUPER FAST SHIPPING. Nº de ref. del artículo: 9781489989710
Comprar nuevo
EUR 88,66
Gastos de envío:
EUR 7,77
A Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Computability and Complexity Theory
Publicado por
Springer US, Springer New York Mär 2014, 2014
ISBN 10: 1489989714
ISBN 13: 9781489989710
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations. Subsequent chapters move from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability, NP-completeness, andrelative computability focus on the limitations of computability and the distinctions between feasible and intractable. Substantial new content in this edition includes:a chapter on nonuniformity studying Boolean circuits, advice classes and the important result of Karp¿Lipton.a chapter studying properties of the fundamental probabilistic complexity classesa study of the alternating Turing machine and uniform circuit classes.an introduction of counting classes, proving the famous results of Valiant and Vazirani and of Todaa thorough treatment of the proof that IP is identical to PSPACEWith its accessibility and well-devised organization, this text/reference is an excellent resource and guide for those looking to develop a solid grounding in the theory of computing. Beginning graduates, advanced undergraduates, and professionals involved in theoretical computer science, complexity theory, and computability will find the book an essential andpractical learning tool.Topics and features: Concise, focused materials cover the most fundamental concepts and results in the field of modern complexity theory, including the theory of NP-completeness, NP-hardness, the polynomial hierarchy, and complete problems for other complexity classesContains information that otherwise exists only in research literature and presents it in a unified, simplified mannerProvides key mathematical background information, including sections on logic and number theory and algebraSupported by numerous exercises and supplementary problems for reinforcement and self-study purposesSpringer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 316 pp. Englisch. Nº de ref. del artículo: 9781489989710
Comprar nuevo
EUR 90,94
Gastos de envío:
EUR 60,00
De Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Computability and Complexity Theory
Publicado por
Springer US Mrz 2014, 2014
ISBN 10: 1489989714
ISBN 13: 9781489989710
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations. Subsequent chapters move from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability, NP-completeness, and relative computability focus on the limitations of computability and the distinctions between feasible and intractable. Substantial new content in this edition includes:a chapter on nonuniformity studying Boolean circuits, advice classes and the important result of Karp Lipton.a chapter studying properties of the fundamental probabilistic complexity classesa study of the alternating Turing machine and uniform circuit classes. an introduction of counting classes, proving the famous results of Valiant and Vazirani and of Todaa thorough treatment of the proof that IP is identical to PSPACE With its accessibility and well-devised organization, this text/reference is an excellent resource and guide for those looking to develop a solid grounding in the theory of computing. Beginning graduates, advanced undergraduates, and professionals involved in theoretical computer science, complexity theory, and computability will find the book an essential and practical learning tool. Topics and features: Concise, focused materials cover the most fundamental concepts and results in the field of modern complexity theory, including the theory of NP-completeness, NP-hardness, the polynomial hierarchy, and complete problems for other complexity classes Contains information that otherwise exists only in research literature and presents it in a unified, simplified mannerProvides key mathematical background information, including sections on logic and number theory and algebra Supported by numerous exercises and supplementary problems for reinforcement and self-study purposes 316 pp. Englisch. Nº de ref. del artículo: 9781489989710
Comprar nuevo
EUR 90,94
Gastos de envío:
EUR 23,00
De Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen de archivo
Computability and Complexity Theory (Texts in Computer Science)
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: ria9781489989710_new
Comprar nuevo
EUR 92,73
Gastos de envío:
EUR 13,63
De Reino Unido a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Computability and Complexity Theory (Texts in Computer Science)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar2716030159303
Comprar nuevo
EUR 94,49
Gastos de envío:
EUR 3,45
A Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Computability and Complexity Theory
Publicado por
Springer US, Springer New York, 2014
ISBN 10: 1489989714
ISBN 13: 9781489989710
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations. Subsequent chapters move from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability, NP-completeness, and relative computability focus on the limitations of computability and the distinctions between feasible and intractable. Substantial new content in this edition includes:a chapter on nonuniformity studying Boolean circuits, advice classes and the important result of Karp Lipton.a chapter studying properties of the fundamental probabilistic complexity classesa study of the alternating Turing machine and uniform circuit classes. an introduction of counting classes, proving the famous results of Valiant and Vazirani and of Todaa thorough treatment of the proof that IP is identical to PSPACE With its accessibility and well-devised organization, this text/reference is an excellent resource and guide for those looking to develop a solid grounding in the theory of computing. Beginning graduates, advanced undergraduates, and professionals involved in theoretical computer science, complexity theory, and computability will find the book an essential andpractical learning tool. Topics and features: Concise, focused materials cover the most fundamental concepts and results in the field of modern complexity theory, including the theory of NP-completeness, NP-hardness, the polynomial hierarchy, and complete problems for other complexity classes Contains information that otherwise exists only in research literature and presents it in a unified, simplified mannerProvides key mathematical background information, including sections on logic and number theory and algebra Supported by numerous exercises and supplementary problems for reinforcement and self-study purposes. Nº de ref. del artículo: 9781489989710
Comprar nuevo
EUR 96,84
Gastos de envío:
EUR 62,41
De Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen de archivo
Computability and Complexity Theory
Publicado por
Springer-Verlag New York Inc., 2014
ISBN 10: 1489989714
ISBN 13: 9781489989710
Nuevo
Paperback / softback
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 516. Nº de ref. del artículo: C9781489989710
Comprar nuevo
EUR 110,63
Gastos de envío:
EUR 18,10
De Reino Unido a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Computability and Complexity Theory
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 316. Nº de ref. del artículo: 26127764326
Comprar nuevo
EUR 120,20
Gastos de envío:
EUR 3,45
A Estados Unidos de America
Cantidad disponible: 4 disponibles
Imagen de archivo
Computability and Complexity Theory
Impresión bajo demandaLibrería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Condición: New. Print on Demand pp. 316 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Nº de ref. del artículo: 132790457
Comprar nuevo
EUR 127,30
Gastos de envío:
EUR 7,40
De Reino Unido a Estados Unidos de America
Cantidad disponible: 4 disponibles