Theory of Computation - Dexter C. Kozen - Librairie Eyrolles

Déjà client ? Identifiez-vous

Mot de passe oublié ?

Nouveau client ?

CRÉER VOTRE COMPTE
Theory of Computation
Ajouter à une liste

Librairie Eyrolles - Paris 5e
Indisponible

Theory of Computation

Theory of Computation

Dexter C. Kozen - Collection Texts in Computer Science

440 pages, parution le 30/05/2006

Résumé

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.

Écrit pour: Advanced undergraduates, graduates, lecturers

Sommaire

  • Lectures
    • The Complexity of Computations
    • Time and Space Complexity Classes and Savitch's Theorem
    • Separation Results
    • Logspace Computability
    • The Circuit Value Problem
    • The Knaster-Tarski Theorem
    • Alternation
    • The Polynomial-Time Hierarchy
    • Parallel Complexity
    • Probabilistic Complexity
    • Chinese Remaindering
    • Berlekamp's Algorithm
    • Interactive Proofs
    • Probabilistically Checkable Proofs
    • Complexity of Decidable Theories
    • Complexity of the Theory of Real Addition
    • Lower Bound for the Theory of Real Addition
    • Safra's Construction
    • Relativized Complexity
    • Nonexistence of Sparse Complete Sets
    • Unique Satisfiability
    • Toda's Theorem
    • Lower Bounds for Constant Depth Circuits
    • The Switching Lemma
    • Tail Bounds
    • Applications of the Recursion Theorem
    • 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
  • Hints and Solutions
Voir tout
Replier

Caractéristiques techniques

  PAPIER
Éditeur(s) Springer
Auteur(s) Dexter C. Kozen
Collection Texts in Computer Science
Parution 30/05/2006
Nb. de pages 440
Format 18,5 x 24
Couverture Relié
Poids 885g
Intérieur Noir et Blanc
EAN13 9781846282973
ISBN13 978-1-84628-297-3

Avantages Eyrolles.com

Livraison à partir de 0,01 en France métropolitaine
Paiement en ligne SÉCURISÉ
Livraison dans le monde
Retour sous 15 jours
+ d'un million et demi de livres disponibles
satisfait ou remboursé
Satisfait ou remboursé
Paiement sécurisé
modes de paiement
Paiement à l'expédition
partout dans le monde
Livraison partout dans le monde
Service clients sav@commande.eyrolles.com
librairie française
Librairie française depuis 1925
Recevez nos newsletters
Vous serez régulièrement informé(e) de toutes nos actualités.
Inscription