• 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
Complexity Theory: Exploring the Limits of Efficient Algorithms

Complexity Theory: Exploring the Limits of Efficient Algorithms

Paperback

General Computers

ISBN10: 3642059147
ISBN13: 9783642059148
Publisher: Springer
Published: Oct 13 2010
Pages: 308
Weight: 1.00
Height: 0.67 Width: 6.14 Depth: 9.21
Language: English

Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits what is possible with the available resources. The results prevent the search for non-existing efficient algorithms. The theory of NP-completeness has influenced the development of all areas of computer science. New branches of complexity theory react to all new algorithmic concepts. This textbook considers randomization as a key concept. The chosen subjects have implications to concrete applications. The significance of complexity theory for today's computer science is stressed.

Also in

General Computers