Contact
How to shop
Delivery
Shopping guide
Towards Dynamic Randomized Algorithms in Computational Geometry
English
136 b
Up to 30 days for returns
Customers also purchased
/
Paperback
9 483
Ft
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.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
4 779
Ft
/
Paperback
11 875
Ft
Hi! I'm Libroamiko, your book advisor.
How can I help you?