Cascading Divide-And-Conquer: A Technique for Designing Parallel Algorithms (Classic Reprint) - Couverture rigide

Mikhail J. Atallah

Couverture rigide

ISBN 10 : 0331592258 ISBN 13 : 9780331592252

Editeur : Forgotten Books, 2018

Synopsis

Excerpt from Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms

Visibility from a Point: Given n line segments such that no two intersect (except possibly at endpoints) and a point p, determine that part of the plane visible from p if all the segments are opaque. A (log nlog log n,u) solution was given in We improve this to (log n,u).

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

Détails de l'édition

• Éditeur: Forgotten Books
• Date d'édition: 2018
• Langue: anglais
• ISBN 10: 0331592258
• ISBN 13: 9780331592252
• Reliure: Relié
• Nombre de pages: 49
• Coordonnées du fabricant: Copytech (UK) Ltd, Trading as Printondemand-worldwide.com; gpsr@podww.com; ; 9 Culley Court; Orton Southgate; Peterborough; Cambridgeshire; PE2 6WA; Royaume-Uni
• Personne responsable: Easy Access System Europe Oü, 16879218; +358405003575; gpsr.requests@easproject.com; ; Mustamäe tee 50; Tallinn; 10621; Estonie