Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

Complexity Theory: Exploring the Limits of Efficient Algorithms - Ingo Wegener

inglise keel
2005-04-11
79,19 € 131,98 €

-40% koodiga BOOKS

Meie tarnija laos

Saadetis 17-23 tööpäeva jooksul

30-päevane tagastamisõigus

Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice: New branches of ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice: New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results - such as the theory of NP-completeness - have influenced the development of all areas of computer science. The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.

Lisateave

Autor Ingo Wegener
Kirjastaja Springer Berlin Heidelberg
Väljalaskeaasta 2005
Kaanetüüp Kõvakaaneline
EAN 9783540210450
Kirjuta oma arvustus
Te vaatate: Complexity Theory: Exploring the Limits of Efficient Algorithms
Teie hinnang:

Goodreads'i arvustused

79,19 € 131,98 €