- 5 Résultats
prix le plus bas: € 74,99, prix le plus élevé: € 99,91, prix moyen: € 85,40
1
Theory of Computation - Dexter C. Kozen
Commander
sur Springer.com
€ 85,55
Envoi: € 0,001
CommanderLien sponsorisé
Dexter C. Kozen:

Theory of Computation - Livres de poche

ISBN: 9781849965712

In these early years of the 21st Century, researchers in the field of computing are delving ever further into the new possibilities of the science and to the primary tools that form its f… Plus…

new in stock. Frais d'envoizzgl. Versandkosten. (EUR 0.00)
2
Theory of Computation / Dexter C. Kozen / Taschenbuch / Texts in Computer Science / Paperback / xiv / Englisch / 2010 / Springer London / EAN 9781849965712 - Kozen, Dexter C.
Commander
sur booklooker.de
€ 79,92
Envoi: € 0,001
CommanderLien sponsorisé

Kozen, Dexter C.:

Theory of Computation / Dexter C. Kozen / Taschenbuch / Texts in Computer Science / Paperback / xiv / Englisch / 2010 / Springer London / EAN 9781849965712 - Livres de poche

2010, ISBN: 9781849965712

Edition reliée

[ED: Taschenbuch], [PU: Springer London], This textbook is uniquely written with dual purpose. It cover cores material in the foundations of computing for graduate students in computer sc… Plus…

Frais d'envoiVersandkostenfrei, Versand nach Deutschland. (EUR 0.00) Buchbär
3
Theory of Computation (Texts in Computer Science) - Kozen, Dexter C.
Commander
sur Amazon.de (Intern. Bücher)
€ 99,91
Envoi: € 3,001
CommanderLien sponsorisé
Kozen, Dexter C.:
Theory of Computation (Texts in Computer Science) - Livres de poche

2010

ISBN: 9781849965712

Springer, Taschenbuch, Auflage: Softcover reprint of hardcover 1st ed. 2006, 436 Seiten, Publiziert: 2010-10-21T00:00:01Z, Produktgruppe: Buch, 0.75 kg, Verkaufsrang: 2818813, Informatik,… Plus…

Gut Frais d'envoiAuf Lager. Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00) Fast Cat Books
4
Theory of Computation (Texts in Computer Science) - Kozen, Dexter C.
Commander
sur Amazon.de (Intern. Bücher)
€ 74,99
Envoi: € 0,001
CommanderLien sponsorisé
Kozen, Dexter C.:
Theory of Computation (Texts in Computer Science) - Livres de poche

2010, ISBN: 9781849965712

Springer, Taschenbuch, Auflage: Softcover reprint of hardcover 1st ed. 2006, 436 Seiten, Publiziert: 2010-10-21T00:00:01Z, Produktgruppe: Buch, 0.75 kg, Verkaufsrang: 2818813, Informatik,… Plus…

Frais d'envoiAuf Lager, Lieferung von Amazon. (EUR 0.00) Amazon.de
5
Theory of Computation - Kozen, Dexter C.
Commander
sur Achtung-Buecher.de
€ 86,63
Envoi: € 0,001
CommanderLien sponsorisé
Kozen, Dexter C.:
Theory of Computation - Livres de poche

2010, ISBN: 1849965714

Edition reliée

Softcover reprint of hardcover 1st ed. 2006 Kartoniert / Broschiert Algorithmen und Datenstrukturen, Theoretische Informatik, Automat; algorithm; automata; complexity; complexitytheory;… Plus…

Frais d'envoiVersandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien

1Comme certaines plateformes ne transmettent pas les conditions d'expédition et que celles-ci peuvent dépendre du pays de livraison, du prix d'achat, du poids et de la taille de l'article, d'une éventuelle adhésion de la plateforme, d'une livraison directe par la plateforme ou via un prestataire tiers (Marketplace), etc. il est possible que les frais de livraison indiqués par eurolivre ne correspondent pas à ceux de la plateforme qui propose l'article.

Données bibliographiques du meilleur livre correspondant

Détails sur le livre
Theory of Computation (Texts in Computer Science)

This textbook is uniquely written with dual purpose. It cover cores material in the foundations of computing for graduate students in computer science and also provides an introduction to some more advanced topics for those intending further study in the area. This innovative text focuses primarily on computational complexity theory: the classification of computational problems in terms of their inherent complexity. The book contains an invaluable collection of lectures for first-year graduates on the theory of computation. Topics and features include more than 40 lectures for first year graduate students, and a dozen homework sets and exercises.

Informations détaillées sur le livre - Theory of Computation (Texts in Computer Science)


EAN (ISBN-13): 9781849965712
ISBN (ISBN-10): 1849965714
Version reliée
Livre de poche
Date de parution: 2010
Editeur: Springer
436 Pages
Poids: 0,752 kg
Langue: eng/Englisch

Livre dans la base de données depuis 2011-04-03T03:03:23+02:00 (Paris)
Page de détail modifiée en dernier sur 2024-02-13T15:43:24+01:00 (Paris)
ISBN/EAN: 9781849965712

ISBN - Autres types d'écriture:
1-84996-571-4, 978-1-84996-571-2
Autres types d'écriture et termes associés:
Auteur du livre: dexter, kozen
Titre du livre: theory computation


Données de l'éditeur

Auteur: Dexter C. Kozen
Titre: Texts in Computer Science; Theory of Computation
Editeur: Springer; Springer London
418 Pages
Date de parution: 2010-10-21
London; GB
Imprimé / Fabriqué en
Langue: Anglais
87,95 € (DE)

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithms; Automat; algorithm; automata; complexity; complexity theory; computer; computer science; construction; logic; algorithm analysis and problem complexity; Theory of Computation; Computational Mathematics and Numerical Analysis; Computational Science and Engineering; Algorithms; Numerische Mathematik; Algorithmen und Datenstrukturen; BB

Lectures.- The Complexity of Computations.- Time and Space Complexity Classes and Savitch’s Theorem.- Separation Results.- The Immerman-Szelepcsényi Theorem.- Logspace Computability.- The Circuit Value Problem.- The Knaster-Tarski Theorem.- Alternation.- Problems Complete for PSPACE.- The Polynomial-Time Hierarchy.- More on the Polynomial-Time Hierarchy.- Parallel Complexity.- Relation of NC to Time-Space Classes.- Probabilistic Complexity.- BPP ?2P ? ?2P.- Chinese Remaindering.- Complexity of Primality Testing.- Berlekamp’s Algorithm.- Interactive Proofs.- PSPACE IP.- IP PSPACE.- Probabilistically Checkable Proofs.- NP PCP(n3, 1).- More on PCP.- A Crash Course in Logic.- Complexity of Decidable Theories.- Complexity of the Theory of Real Addition.- Lower Bound for the Theory of Real Addition.- Lower Bound for Integer Addition.- Automata on Infinite Strings and S1S.- Determinization of ?-Automata.- Safra’s Construction.- Relativized Complexity.- Nonexistence of Sparse Complete Sets.- Unique Satisfiability.- Toda’s Theorem.- Circuit Lower Bounds and Relativized PSPACE = PH.- Lower Bounds for Constant Depth Circuits.- The Switching Lemma.- Tail Bounds.- The Gap Theorem and Other Pathology.- Partial Recursive Functions and Gödel Numberings.- Applications of the Recursion Theorem.- Abstract Complexity.- The Arithmetic Hierarchy.- Complete Problems in the Arithmetic Hierarchy.- Post’s Problem.- The Friedberg-Muchnik Theorem.- The Analytic Hierarchy.- Kleene’s Theorem.- Fair Termination and Harel’s Theorem.- Exercises.- Homework 1.- Homework 2.- Homework 3.- Homework 4.- Homework 5.- Homework 6.- Homework 7.- Homework 8.- Homework 9.- Homework 10.- Homework 11.- Homework 12.- Miscellaneous Exercises.- Hints and Solutions.- Homework 1Solutions.- Homework 2 Solutions.- Homework 3 Solutions.- Homework 4 Solutions.- Homework 5 Solutions.- Homework 6 Solutions.- Homework 7 Solutions.- Homework 8 Solutions.- Homework 9 Solutions.- Homework 10 Solutions.- Homework 11 Solutions.- Homework 12 Solutions.- Hints for Selected Miscellaneous Exercises.- Solutions to Selected Miscellaneous Exercises.

Autres livres qui pourraient ressembler au livre recherché:

Dernier livre similaire:
2901846282972 Theory of Computation (Dexter C. Kozen)


< pour archiver...