• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Computability and Complexity Theory

Computability and Complexity Theory

Paperback

Series: Texts in Computer Science

General ComputersGeneral MathematicsProgramming

ISBN10: 1489989714
ISBN13: 9781489989710
Publisher: Springer
Published: Mar 3 2014
Pages: 300
Weight: 0.98
Height: 0.66 Width: 6.14 Depth: 9.21
Language: English

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:

1 different editions

Also available

Also from

Homer, Steven

Also in

General Computers