Computability and Complexity Theory
Homer, Steven; Selman, Alan L.
ISBN 10: 1461406811 ISBN 13: 9781461406815
Editorial: Springer, 2011
Usado
Encuadernación de tapa dura
Librería:
GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Vendedor de AbeBooks desde 6 de abril de 2009
Este artículo en concreto ya no está disponible.
Descripción
Descripción:
May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers. N° de ref. del artículo 13310234-5
Sinopsis:
Preliminaries.- Introduction to Computability.- Undecidability.- Introduction to Complexity Theory.- Basic Results of Complexity Theory.- Nondeterminism and NP-Completeness.- Relative Computability.- Nonuniform Complexity.- Parallelism.- Probabilistic Complexity Classes.- Introduction to Counting Classes.- Interactive Proof Systems.- References.- Author Index.- Subject Index.
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: 2011
Encuadernación: Encuadernación de tapa dura
Condición: good
Edición: 2ª Edición
Los mejores resultados en AbeBooks
Imagen de archivo
Computability and Complexity Theory (Texts in Computer Science)
Librería: HPB-Red, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Nº de ref. del artículo: S_332974070
Cantidad disponible: 1 disponibles
Imagen del vendedor
Computability and Complexity Theory
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Gebunden. Condición: New. Nº de ref. del artículo: 4196902
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: 9781461406815
Cantidad disponible: 1 disponibles
Imagen del vendedor
Computability and Complexity Theory
Impresión bajo demandaLibrería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. 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: 9781461406815
Cantidad disponible: 2 disponibles
Imagen del vendedor
Computability and Complexity Theory
Publicado por
Springer US, Springer New York Dez 2011, 2011
ISBN 10: 1461406811
ISBN 13: 9781461406815
Nuevo
Buch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. 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: 9781461406815
Cantidad disponible: 2 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: ABLIING23Mar2716030035129
Cantidad disponible: Más de 20 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: ria9781461406815_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Computability and Complexity Theory
Publicado por
Springer US, Springer New York, 2011
ISBN 10: 1461406811
ISBN 13: 9781461406815
Nuevo
Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. 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: 9781461406815
Cantidad disponible: 1 disponibles
Imagen de archivo
Computability and Complexity Theory
Publicado por
Springer-Verlag New York Inc., 2011
ISBN 10: 1461406811
ISBN 13: 9781461406815
Nuevo
Tapa dura
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 667. Nº de ref. del artículo: C9781461406815
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 2nd Edition. Nº de ref. del artículo: 2658581478
Cantidad disponible: 4 disponibles