- 5 Results
Lowest price: € 73.92, highest price: € 145.71, average price: € 101.27
1
Theory of Computation: Classical and Contemporary Approaches (Texts in Computer Science) - Kozen, Dexter C.
Order
at amazon.de
€ 95.99
Shipment: € 0.001
Order
Provider details
Sponsored link
Kozen, Dexter C.:

Theory of Computation: Classical and Contemporary Approaches (Texts in Computer Science) - hardcover

2006, ISBN: 9781846282973

Springer, Gebundene Ausgabe, Auflage: 2006, 432 Seiten, Publiziert: 2006-05-08T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: 1 black & white illustrations, biography, 2.26 kg, Verkaufsr… More...

Shipping costs:Auf Lager. Lieferung von Amazon. (EUR 0.00) Amazon.de
close (x)
2
Theory of Computation - Kozen, Dexter C.
Order
at Achtung-Buecher.de
€ 108.33
Shipment: € 0.001
Order
Provider details
Sponsored link

Kozen, Dexter C.:

Theory of Computation - hardcover

2006, ISBN: 1846282977

2006 Gebundene Ausgabe Informatik, Mathematik / Informatik, Computer, Algorithmen und Datenstrukturen, Theoretische Informatik, algorithms; Automat; algorithm; automata; complexity; com… More...

Shipping costs:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
close (x)
3
Order
at AbeBooks.de
€ 82.41
Shipment: € 45.471
Order
Provider details
Sponsored link
Kozen, Dexter C.:
Theory of Computation (Texts in Computer Science) - hardcover

2006

ISBN: 1846282977

[EAN: 9781846282973], Gebraucht, guter Zustand, [PU: Springer], Buy with confidence! Book is in good condition with minor wear to the pages, binding, and minor marks within, Books

NOT NEW BOOK. Shipping costs: EUR 45.47 Books Unplugged, Amherst, NY, U.S.A. [74050220] [Rating: 5 (von 5)]
close (x)
4
Order
at alibris.co.uk
€ 145.71
Order
Details & Shipping
Sponsored link
Dexter C. Kozen:
Theory of Computation: Classical and Contemporary Approaches - First edition

2006, ISBN: 9781846282973

Hardcover

Hardcover, 1st edition. 418 pages. 9.25x7.00x0.75 inches., Neubuch, [ED: 1], [PU: Springer-Verlag New York Inc]

Shipping costs:plus shipping costs Exeter, DEVON, Revaluation Books
close (x)
5
Order
at AbeBooks.de
€ 73.92
Shipment: € 29.971
Order
Provider details
Sponsored link
Kozen, Dexter C.:
Theory of Computation (Texts in Computer Science) - hardcover

2006, ISBN: 1846282977

[EAN: 9781846282973], Neubuch, [PU: Springer], Books

NEW BOOK. Shipping costs: EUR 29.97 Hafa Adai Books, Moncks Corner, SC, U.S.A. [82795001] [Rating: 5 (von 5)]
close (x)
1As some platforms do not transmit shipping conditions to us and these may depend on the country of delivery, the purchase price, the weight and size of the item, a possible membership of the platform, a direct delivery by the platform or via a third-party provider (Marketplace), etc., it is possible that the shipping costs indicated by find-more-books.com / find-more-books.com do not correspond to those of the offering platform.

Bibliographic data of the best matching book

Details of the book
Theory of Computation: Classical and Contemporary Approaches (Texts in Computer Science)
Author:
Title:
ISBN:

9781846282973


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.

Details of the book - Theory of Computation: Classical and Contemporary Approaches (Texts in Computer Science)


EAN (ISBN-13): 9781846282973
ISBN (ISBN-10): 1846282977
Hardcover
Publishing year: 2006
Publisher: Springer
426 Pages
Weight: 0,933 kg
Language: eng/Englisch

Book in our database since 2007-06-07T07:07:23-04:00 (New York)
Detail page last modified on 2024-02-13T09:43:08-05:00 (New York)
ISBN/EAN: 9781846282973

ISBN - alternate spelling:
1-84628-297-7, 978-1-84628-297-3
Alternate spelling and related search-keywords:
Book author: kozen, dexter, byron
Book title: theory computation, the computation 666, jericho, theory wants, classical and contemporary science

Information from Publisher

Author: Dexter C. Kozen
Title: Texts in Computer Science; Theory of Computation
Publisher: Springer; Springer London
418 Pages
Publishing year: 2006-05-08
London; GB
Language: English
109,99 € (DE)

BB; 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; EA; BC

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.
< to archive...