0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Data structures

Buy Now

Computability and Complexity Theory (Hardcover, 2nd ed. 2011) Loot Price: R2,664
Discovery Miles 26 640
Computability and Complexity Theory (Hardcover, 2nd ed. 2011): Steven Homer, Alan L. Selman

Computability and Complexity Theory (Hardcover, 2nd ed. 2011)

Steven Homer, Alan L. Selman

Series: Texts in Computer Science

 (sign in to rate)
Loot Price R2,664 Discovery Miles 26 640 | Repayment Terms: R250 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

This revised and extensively expanded edition of "Computability and Complexity Theory" comprises essential materials that are core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations. Subsequent chapters move from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability, NP-completeness, andrelative computability focus on the limitations of computability and the distinctions between feasible and intractable. Substantial new content in this edition includes: a chapter on nonuniformity studying Boolean circuits, advice classes and the important result of Karp Lipton.a chapter studying properties of the fundamental probabilistic complexity classesa study of the alternating Turing machine and uniform circuit classes. an introduction of counting classes, proving the famous results of Valiant and Vazirani and of Todaa thorough treatment of the proof that IP is identical to PSPACE

With its accessibility and well-devised organization, this text/reference is an excellent resource and guide for those looking to develop a solid grounding in the theory of computing. Beginning graduates, advanced undergraduates, and professionals involved in theoretical computer science, complexity theory, and computability will find the book an essential and practical learning tool.

Topics and features: Concise, focused materials cover the most fundamental concepts and results in the field of modern complexity theory, including the theory of NP-completeness, NP-hardness, the polynomial hierarchy, and complete problems for other complexity classes Contains information that otherwise exists only in research literature and presents it in a unified, simplified mannerProvides key mathematical background information, including sections on logic and number theory and algebra Supported by numerous exercises and supplementary problems for reinforcement and self-study purposes

"

General

Imprint: Springer-Verlag New York
Country of origin: United States
Series: Texts in Computer Science
Release date: December 2011
First published: 2011
Authors: Steven Homer • Alan L. Selman
Dimensions: 235 x 155 x 23mm (L x W x T)
Format: Hardcover
Pages: 300
Edition: 2nd ed. 2011
ISBN-13: 978-1-4614-0681-5
Categories: Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Books > Computing & IT > Applications of computing > General
Promotions
LSN: 1-4614-0681-1
Barcode: 9781461406815

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Data Abstraction and Problem Solving…
Janet Prichard, Frank Carrano Paperback R2,421 Discovery Miles 24 210
A Textbook of Data Structures and…
Vijayalakshmi P Hardcover R3,817 Discovery Miles 38 170
Image Analysis, Classification and…
Morton John Canty Paperback R1,540 Discovery Miles 15 400
MATLAB Applications in Engineering
Constantin Volosencu Hardcover R3,310 Discovery Miles 33 100
The Application of Ant Colony…
Ali Soofastaei Hardcover R2,765 Discovery Miles 27 650
Coding for Kids in Python - Python…
Bob Mather Hardcover R917 Discovery Miles 9 170
Gamma Solution - An Application of…
James R Warren Hardcover R1,338 R1,131 Discovery Miles 11 310
Python Programming for Computations…
Computer Language Hardcover R1,216 R1,024 Discovery Miles 10 240
C Programming - C Programming Language…
Adam Dodson Hardcover R598 R542 Discovery Miles 5 420
The Physics of Computing
Marilyn Wolf Paperback R1,745 Discovery Miles 17 450
Genetic Algorithms with Python
Clinton Sheppard Hardcover R911 R858 Discovery Miles 8 580
Innovative Research and Applications in…
Qusay F. Hassan Hardcover R5,702 Discovery Miles 57 020

See more

Partners