Computers & Internet Books:

Towards Dynamic Randomized Algorithms in Computational Geometry

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

Format:

Paperback / softback
$155.00
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks
Free Delivery with Primate
Join Now

Free 14 day free trial, cancel anytime.

Buy Now, Pay Later with:

4 payments of $38.75 with Afterpay Learn more

6 weekly interest-free payments of $25.83 with Laybuy Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 11-21 June using International Courier

Description

Computational geometry concerns itself with designing andanalyzing algorithms for solving geometric problems. Thefield has reached a high level of sophistication, and verycomplicated algorithms have been designed. However, it isalso useful to develop more practical algorithms, so long asthey are based on rigorous methods. One such method is theuse of randomized algorithms. These algorithms have becomemore and more popular, turning into one of the hottest areasof recent years. Dynamic algorithms are particularlyinteresting because in practice the data of a problem areoften acquired progressively. In this monograph the authorstudies the theoretical complexity and practical efficiencyof randomized dynamic algorithms.
Release date NZ
November 23rd, 1993
Audiences
  • Postgraduate, Research & Scholarly
  • Professional & Vocational
Illustrations
XI, 169 p.
Pages
169
Dimensions
155x233x9
ISBN-13
9783540575030
Product ID
5264009

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Help & options

Filed under...