Kaikki kirjat 35 % alennuksella koodilla: BOOKS

  • check Yli 10 miljoonaa kirjaa
  • check Uutuuksia joka päivä
  • check Yli 1 miljoona asiakasta luottaa meihin
  • check Hyvät hinnat ja alennukset
  • check Toimitus koko Eurooppaan

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

englanti
2005-04-11
93,59 € 143,98 €

-35% koodilla BOOKS

Toimittajalla varastossa

Toimitus 17-23 arkipäivässä

30 päivän palautusoikeus

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äydellinen kuvaus

Saatat myös pitää

Kuvaus

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.

Lisätietoja

Kirjoittaja Ingo Wegener
Julkaisija Springer Berlin Heidelberg
Julkaisuvuosi 2005
Kannen tyyppi Kovakantinen
EAN 9783540210450
Kirjoita oma arvostelusi
Arvostelet: Complexity Theory: Exploring the Limits of Efficient Algorithms
Arvostelusi:

Goodreads-arvostelut

93,59 € 143,98 €