9781461406815 - computability and complexity theory (texts in computer science) de selman, alan l.; homer, steven (13 resultados)
Idioma: Inglés
Editorial: Springer 2011
Serie: Texts in Computer Science, Libro 22 de 83. Libro 22 de 83 - Texts in Computer Science
- Tapa dura
Librería: HPB-Red, Dallas, TX, Estados Unidos de AmericaHPB-Red
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Aceptable
EUR 64,19
Envío por EUR 3,29Se envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
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.
Idioma: Inglés
Editorial: Springer 2011
Serie: Texts in Computer Science, Libro 22 de 83. Libro 22 de 83 - Texts in Computer Science
- Tapa dura
Librería: Ria Christie Collections, Uxbridge, Reino UnidoRia Christie Collections
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 97,30
Envío por EUR 13,88Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. In.
Idioma: Inglés
Editorial: Springer 2011
Serie: Texts in Computer Science, Libro 22 de 83. Libro 22 de 83 - Texts in Computer Science
- Tapa dura
Librería: Books Puddle, New York, NY, Estados Unidos de AmericaBooks Puddle
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 130,00
Envío por EUR 3,50Se envía dentro de Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. pp. 316 2nd Edition.
Idioma: Inglés
Editorial: Springer US 2011
Serie: Texts in Computer Science, Libro 22 de 83. Libro 22 de 83 - Texts in Computer Science
- Tapa dura
Librería: moluna, Greven, Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 79,10
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Gebunden. Condición: New.
Idioma: Inglés
Editorial: Springer-Verlag New York Inc 2011
Serie: Texts in Computer Science, Libro 22 de 83. Libro 22 de 83 - Texts in Computer Science
- Tapa dura
Librería: Revaluation Books, Exeter, Reino UnidoRevaluation Books
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 143,96
Envío por EUR 14,48Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Hardcover. Condición: Brand New. 2nd edition. 298 pages. 9.25x6.00x1.00 inches. In Stock.
Idioma: Inglés
Editorial: Springer US, Springer US 2011
Serie: Texts in Computer Science, Libro 22 de 83. Libro 22 de 83 - Texts in Computer Science
- Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 98,04
Envío por EUR 63,21Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
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 con…cepts 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.
Idioma: Inglés
Editorial: Springer 2011
Serie: Texts in Computer Science, Libro 22 de 83. Libro 22 de 83 - Texts in Computer Science
- Tapa dura
Librería: Mispah books, Redhill, SURRE, Reino UnidoMispah books
Contactar con el vendedorVendedor de 4 estrellasCondición: Usado - Como Nuevo
EUR 162,31
Envío por EUR 28,97Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Idioma: Inglés
Editorial: Springer 2011
Serie: Texts in Computer Science, Libro 22 de 83. Libro 22 de 83 - Texts in Computer Science
- Tapa dura
- Impresión bajo demanda
Librería: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 74,24
Envío por EUR 6,80Se envía de Italia a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: new. Questo è un articolo print on demand.
Idioma: Inglés
Editorial: Springer US Dez 2011 2011
Serie: Texts in Computer Science, Libro 22 de 83. Libro 22 de 83 - Texts in Computer Science
- Tapa blanda
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 90,94
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
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.
Idioma: Inglés
Editorial: Springer-Verlag New York Inc. 2011
Serie: Texts in Computer Science, Libro 22 de 83. Libro 22 de 83 - Texts in Computer Science
- Tapa dura
- Impresión bajo demanda
Librería: THE SAINT BOOKSTORE, Southport, Reino UnidoTHE SAINT BOOKSTORE
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 113,02
Envío por EUR 20,19Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Hardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Idioma: Inglés
Editorial: Springer 2011
Serie: Texts in Computer Science, Libro 22 de 83. Libro 22 de 83 - Texts in Computer Science
- Tapa dura
- Impresión bajo demanda
Librería: Majestic Books, Hounslow, Reino UnidoMajestic Books
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 133,94
Envío por EUR 7,53Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. Print on Demand pp. 316 50 Illus.
Idioma: Inglés
Editorial: Springer 2011
Serie: Texts in Computer Science, Libro 22 de 83. Libro 22 de 83 - Texts in Computer Science
- Tapa dura
- Impresión bajo demanda
Librería: Biblios, frankfurt am main, HESSE, AlemaniaBiblios
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 132,75
Envío por EUR 9,95Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. PRINT ON DEMAND pp. 316.
Idioma: Inglés
Editorial: Springer, Springer Dez 2011 2011
Serie: Texts in Computer Science, Libro 22 de 83. Libro 22 de 83 - Texts in Computer Science
- Tapa blanda
- Impresión bajo demanda
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 90,94
Envío por EUR 60,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Buch. 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 math…ematical 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 purposesLibri GmbH, Europaallee 1, 36244 Bad Hersfeld 316 pp. Englisch.
