Computability and Complexity Theory

Lingua: inglese

Editore: Springer, 2011

1461406811 / 9781461406815

Serie: Libro 22 di 83 - Texts in Computer Science

Da: Home-set, Mannheim, GermaniaHome-set

Venditore con 5 stelle

Venditore AbeBooks dal 13 aprile 2026

Brossura

Condizione: Nuovo

EUR 113,68

EUR 49,90 spedizione 
Spedito da Germania a U.S.A.

Quantità: 2 disponibili

Aggiungi al carrello
Resi gratuiti per 30 giorni

Descrizione dell’articolo da parte del venditore

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 Sprache: Englisch Gewicht in Gramm: 589.…

Titolo
Computability and Complexity Theory
Autore
Alan L. Selman, Steven Homer
Editore
Springer
Anno di pubblicazione
2011
Condizione
Neu
Rilegatura
Gebundene Ausgabe
Lingua
inglese
ISBN 10
1461406811
ISBN 13
9781461406815
Edizione
seconda edizione
Peso dell'articolo
589 grammi
Serie
Libro 22 di 83: Texts in Computer Science

Home-set

Mannheim, Germania

Venditore con 5 stelle

Venditore AbeBooks dal 13 aprile 2026

Tariffe di spedizione da Germania a U.S.A.

ArticoloDa 10 a 12 giorni lavorativiDa 8 a 10 giorni lavorativi
Primo articoloEUR 49,90EUR 75,00
I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.

Metodi di pagamento

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay
  • Assegno

Specializzazione

Buch

Informazioni sull’azienda del venditore

Home-set

Germania