Code: 01565744
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 ... more
English
51.63 €
RRP: 55.90 €
You save 4.28 €

You get 125 loyalty points
Book synopsis
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.
Book details
Book category Books in English Computing & information technology Computer science Mathematical theory of computation
51.63 €
English
Collection points Bratislava a 12849 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
25702 collection points
Delivery 2.99 €
02/210 210 99 (8-15.30h)Shopping cart ( Empty )