Book Details
Delivery Location
Delivery fee: Select location
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 Alan L. Selman, Steven Homer 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 300 pages.
Customers Who Bought This Also Bought
Machine Learning with Python
KSh 14,750.00
Numerical Analysis
KSh 14,150.00
Numerical Nonsmooth Optimization
KSh 28,800.00
Cryptographic Engineering
KSh 39,600.00
Computability and Complexity Theory
KSh 13,500.00
Randomized Algorithms
KSh 14,650.00
Stochastic Approximation and Recursive Algorithms and Applications
KSh 32,400.00
Information Processing and Management of Uncertainty in Knowledge-Based Systems
KSh 19,800.00
Small Summaries for Big Data
KSh 9,550.00
Skew PBW Extensions
KSh 19,800.00
Handbook of Approximation Algorithms and Metaheuristics
KSh 10,500.00
Applications of Flower Pollination Algorithm and its Variants
KSh 23,400.00
