Towards Dynamic Randomized Algorithms in Computational Geometry (Paperback, 1993 ed.)

Computational geometry concerns itself with designing and analyzing 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 hottest 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 efficiency of randomized dynamic algorithms.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Lecture Notes in Computer Science, 758
Release date:	November 1993
First published:	1993
Authors:	Monique Teillaud
Dimensions:	233 x 155 x 9mm (L x W x T)
Format:	Paperback
Pages:	169
Edition:	1993 ed.
ISBN-13:	978-3-540-57503-0
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Promotions > Women In Power > Books
LSN:	3-540-57503-0
Barcode:	9783540575030

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!