Items related to Cascading Divide-and-Conquer: A Technique for Designing...
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms (Classic Reprint) - Hardcover
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.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Cascading Divide-and-Conquer: A Technique for Designing...
Stock Image
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms (Classic Reprint)
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9780331592252
Quantity: 15 available
Stock Image
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms (Classic Reprint)
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9780331592252
Quantity: 15 available