Computability and Complexity Theory by Steven Homer , Alan L. Selman
Requirements: .ePUB reader, 2mb
Overview: 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.
Genre: Non-Fiction > Tech & Devices
Download Instructions:
http://corneey.com/wDt6rb
http://corneey.com/wDt6tw
