Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms (Classic Reprint)

Save £0.40
filler

Title: Hardback
Price:
Sale price£21.60 Regular price£22.00

Description

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.

Details

Publisher - Forgotten Books

Author(s) - Mikhail J. Atallah

Hardback

Published Date -

ISBN - 9780331592252

Dimensions - 22.9 x 15.2 x 0.6 cm

Page Count - 49

Paperback

Published Date -

ISBN - 9781332870325

Dimensions - 22.9 x 15.2 x 0.3 cm

Page Count - 51

Payment & Security

American Express Apple Pay Diners Club Discover Maestro Mastercard Shop Pay Union Pay Visa

Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.

You may also like

Recently viewed