Kontakt
Jak nakupovat
Doručení
Nákupní rádce
Towards Dynamic Randomized Algorithms in Computational Geometry
Angličtina
118 b
Až 30 dní na vrácení zboží
Zákazníci také koupili
/
Brožovaná
550
Kč
Computational geometry concerns itself with designing andanalyzing algorithms for solving geometric problems. The field has reached a high level of sophistication, and very complicated algorithms have been designed. However, it is also useful to develop more practical algorithms, so long as they are based on rigorous methods. One such method is the use of randomized algorithms. These algorithms have become more and more popular, turning into one of the hot test areas of recent years. Dynamic algorithms are particularly interesting because in practice the data of a problem are often acquired progressively. In this monograph the author studies the theoretical complexity and practical efficiencyof randomized dynamic algorithms.
Informace o knize
Angličtina
Darujte tuto knihu ještě dnes
Je to snadné
1 Přidejte knihu do košíku a zvolte doručit jako dárek 2 Obratem vám zašleme poukaz 3 Kniha dorazí na adresu obdarovanéhoMohlo by vás také zajímat
/
Brožovaná
275
Kč
/
Brožovaná
707
Kč
Ahoj! Jsem Libroamiko, tvůj knižní rádce.
Jak ti můžu pomoct?