Book Details
Format
Hardback or Cased Book
Book Series
Texts in Computer Science
ISBN-10
1461406811
ISBN-13
9781461406815
Edition
2nd ed. 2011
Publisher
Springer-Verlag New York Inc.
Imprint
Springer-Verlag New York Inc.
Country of Manufacture
US
Country of Publication
GB
Publication Date
Dec 9th, 2011
Print length
300 Pages
Weight
610 grams
Dimensions
24.40 x 16.40 x 2.30 cms
Product Classification:
Algorithms & data structuresAlgorithms and data structuresComputer science
Ksh 13,500.00
Werezi Extended Catalogue
0 in stock
Delivery Location
Delivery fee: Select location
Secure
Quality
Fast
This book surveys theoretical computer science, presenting fundamental concepts and results. Updated and revised, the new edition includes two new chapters on nonuniform complexity, circuit complexity and parallel complexity, and randomized complexity.
Preliminaries.- Introduction to Computability.- Undecidability.- Introduction to Complexity Theory.- Basic Results of Complexity Theory.- Nondeterminism and NP-Completeness.- Relative Computability.- Nonuniform Complexity.- Parallelism.- Probabilistic Complexity Classes.- Introduction to Counting Classes.- Interactive Proof Systems.- References.- Author Index.- Subject Index.
Get Computability and Complexity Theory by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Springer-Verlag New York Inc. and it has pages.
