Home » Nonfiction » Steven Homer » Computability and Complexity Theory

August 23 , 2009

Computability and Complexity Theory


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, and relative computability focus on the limitations of computability and the distinctions between feasible and intractable.Substantial new content in this edition includes:

Download epub

Read also

Flames and Water

Zane Halloway is hired to find the pirate he killed twelve years ago.Two years have passed since the events of LIGHTNING AND THRONES. Zane Halloway has grown used to operating alone, and he's even toying with the idea of retirement. One night Amber Longstrain informs him her husband, the famed pirate Zane made his reputation by…

  • 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 classes
  • a 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 Toda
  • a 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, focusedmaterials 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 manner
  • Provides 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

Show more...

How to download book

Buy this book

You can buy this book now only for $45.49. This is the lowest price for this book.

Buy book

Download book free

If you want to download this book for free, please register, approve your account and get one book for free.


After that you may download book «Computability and Complexity Theory»:

Download XML Book:


Download ePub: