ISBN: 9781489989710 - computability and complexity theory (texts in computer science) (13 resultados)

ISBN: 
Refinar con la Búsqueda avanzada

Filtrar la búsqueda

  • Libros (13)

a

Intervalo de precios personalizado (EUR)

a

  • Idioma: Inglés

    Editorial: Springer, 2014

    1489989714 / 9781489989710

    Serie: Libro 22 de 83 - Texts in Computer Science

    • Tapa blanda

    Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 117,72

    Envío por EUR 2,41 
    Se envía dentro de Estados Unidos de America

    Cantidad disponible: 15 disponibles

    Condición: New.

  • Idioma: Inglés

    Editorial: Springer, 2014

    1489989714 / 9781489989710

    Serie: Libro 22 de 83 - Texts in Computer Science

    • Tapa blanda

    Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Usado - Como Nuevo

    EUR 118,49

    Envío por EUR 2,41 
    Se envía dentro de Estados Unidos de America

    Cantidad disponible: 15 disponibles

    Condición: As New. Unread book in perfect condition.

  • Idioma: Inglés

    Editorial: Springer, 2014

    1489989714 / 9781489989710

    Serie: Libro 22 de 83 - Texts in Computer Science

    • Tapa blanda

    Librería: Ria Christie Collections, Uxbridge, Reino UnidoRia Christie Collections

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 110,33

    Envío por EUR 13,37 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Condición: New. In English.

  • Idioma: Inglés

    Editorial: Springer US, 2014

    1489989714 / 9781489989710

    Serie: Libro 22 de 83 - Texts in Computer Science

    • Tapa blanda

    Librería: moluna, Greven, Alemaniamoluna

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 79,10

    Envío por EUR 48,99 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Condición: New.

  • Idioma: Inglés

    Editorial: Springer, 2014

    1489989714 / 9781489989710

    Serie: Libro 22 de 83 - Texts in Computer Science

    • Tapa blanda

    Librería: Books Puddle, Woodside, NY, Estados Unidos de AmericaBooks Puddle

    Vendedor de 4 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 142,70

    Envío por EUR 3,64 
    Se envía dentro de Estados Unidos de America

    Cantidad disponible: 4 disponibles

    Condición: New. pp. 316.

  • Idioma: Inglés

    Editorial: Springer, 2014

    1489989714 / 9781489989710

    Serie: Libro 22 de 83 - Texts in Computer Science

    • Tapa blanda

    Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 108,15

    Envío por EUR 35,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 1 disponible

    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.…

  • Más imágenes

    Idioma: Inglés

    Editorial: Springer, 2014

    1489989714 / 9781489989710

    Serie: Libro 22 de 83 - Texts in Computer Science

    • Tapa blanda

    Librería: preigu, Osnabrück, Alemaniapreigu

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 82,05

    Envío por EUR 70,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 5 disponibles

    Taschenbuch. Condición: Neu. Computability and Complexity Theory | Steven Homer (u. a.) | Taschenbuch | Texts in Computer Science | 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. …

  • Idioma: Inglés

    Editorial: Springer, 2014

    1489989714 / 9781489989710

    Serie: Libro 22 de 83 - Texts in Computer Science

    • Tapa blanda
    • Impresión bajo demanda

    Librería: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 74,24

    Envío por EUR 5,50 
    Se envía de Italia a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Condición: new. Questo è un articolo print on demand.

  • Idioma: Inglés

    Editorial: Springer 2014-03, 2014

    1489989714 / 9781489989710

    Serie: Libro 22 de 83 - Texts in Computer Science

    • Tapa blanda
    • Impresión bajo demanda

    Librería: Chiron Media, Wallingford, Reino UnidoChiron Media

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 97,22

    Envío por EUR 5,95 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: 20 disponibles

    PF. Condición: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

  • Idioma: Inglés

    Editorial: Springer US Mrz 2014, 2014

    1489989714 / 9781489989710

    Serie: 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.

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 90,94

    Envío por EUR 23,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 2 disponibles

    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.…

  • Idioma: Inglés

    Editorial: Springer, 2014

    1489989714 / 9781489989710

    Serie: Libro 22 de 83 - Texts in Computer Science

    • Tapa blanda
    • Impresión bajo demanda

    Librería: Majestic Books, Hounslow, Reino UnidoMajestic Books

    Vendedor de 4 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 146,90

    Envío por EUR 7,75 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: 4 disponibles

    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.

  • Idioma: Inglés

    Editorial: Springer, Humana Mär 2014, 2014

    1489989714 / 9781489989710

    Serie: Libro 22 de 83 - Texts in Computer Science

    • Tapa blanda
    • Impresión bajo demanda

    Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 90,94

    Envío por EUR 60,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 1 disponible

    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 KG, Sachsenplatz 4-6, 1201 Wien 316 pp. Englisch.…

  • Idioma: Inglés

    Editorial: Springer, 2014

    1489989714 / 9781489989710

    Serie: Libro 22 de 83 - Texts in Computer Science

    • Tapa blanda
    • Impresión bajo demanda

    Librería: Biblios, frankfurt am main, HESSE, AlemaniaBiblios

    Vendedor de 4 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 145,52

    Envío por EUR 9,95 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 4 disponibles

    Condición: New. PRINT ON DEMAND pp. 316.