0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar Disc (Classic Reprint) als von
5 Angebote vergleichen
Bester Preis: € 19,85 (vom 25.02.2018)1
Symbolbild
0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar Disc (Classic Reprint) (Hardback) (2018)
EN HC NW RP
ISBN: 9780483774360 bzw. 0483774367, in Englisch, Forgotten Books, gebundenes Buch, neu, Nachdruck.
Lieferung aus: Vereinigtes Königreich Großbritannien und Nordirland, Free shipping.
Von Händler/Antiquariat, The Book Depository [54837791], London, United Kingdom.
Language: English . Brand New Book ***** Print on Demand *****.Excerpt from 0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar Disc Related problems, such as estimating the area of the union of many discs in the plane, were first posed by [shamos, Monte - Carlo techniques for computing the volume of the union of n spheres in k dimensions were given in [spirakis, They run in time 0(nk) and are based on a method developed by [karp, Luby, 83] for estimation of the failure probability of an n component system. Also, [sharir, 83] shows how to construct the Voronoi diagram of a set of n circular bodies, in time 0(nlog2n) About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at 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.
Von Händler/Antiquariat, The Book Depository [54837791], London, United Kingdom.
Language: English . Brand New Book ***** Print on Demand *****.Excerpt from 0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar Disc Related problems, such as estimating the area of the union of many discs in the plane, were first posed by [shamos, Monte - Carlo techniques for computing the volume of the union of n spheres in k dimensions were given in [spirakis, They run in time 0(nk) and are based on a method developed by [karp, Luby, 83] for estimation of the failure probability of an n component system. Also, [sharir, 83] shows how to construct the Voronoi diagram of a set of n circular bodies, in time 0(nlog2n) About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at 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.
2
0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar Disc (Classic Reprint) (2018)
EN HC US RP
ISBN: 9780483774360 bzw. 0483774367, in Englisch, 24 Seiten, Forgotten Books, gebundenes Buch, gebraucht, Nachdruck.
Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 1-3 weeks, Real shipping costs can differ.
Von Händler/Antiquariat, Wordery USA.
Excerpt from 0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar Disc Related problems, such as estimating the area of the union of many discs in the plane, were first posed by [shamos, monte-carlo techniques for computing the volume of the union of n spheres in k dimensions were given in [spirakis, They run in time O(nk) and are based on a method developed by [karp, Luby, 83] for estimation of the failure probability of an n component system. Also, [sharir, 83] shows how to construct the Voronoi diagram of a set of n circular bodies, in time O(nlog2n) 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. Hardcover, Label: Forgotten Books, Forgotten Books, Product group: Book, Published: 2018-02-11, Studio: Forgotten Books.
Von Händler/Antiquariat, Wordery USA.
Excerpt from 0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar Disc Related problems, such as estimating the area of the union of many discs in the plane, were first posed by [shamos, monte-carlo techniques for computing the volume of the union of n spheres in k dimensions were given in [spirakis, They run in time O(nk) and are based on a method developed by [karp, Luby, 83] for estimation of the failure probability of an n component system. Also, [sharir, 83] shows how to construct the Voronoi diagram of a set of n circular bodies, in time O(nlog2n) 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. Hardcover, Label: Forgotten Books, Forgotten Books, Product group: Book, Published: 2018-02-11, Studio: Forgotten Books.
3
Symbolbild
0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar Disc (Classic Reprint) (Hardback) (2018)
EN HC NW RP
ISBN: 9780483774360 bzw. 0483774367, in Englisch, Forgotten Books, gebundenes Buch, neu, Nachdruck.
Lieferung aus: Vereinigtes Königreich Großbritannien und Nordirland, Free shipping.
Von Händler/Antiquariat, Book Depository hard to find [63688905], London, United Kingdom.
Language: English . This book usually ship within 10-15 business days and we will endeavor to dispatch orders quicker than this where possible. Brand New Book.
Von Händler/Antiquariat, Book Depository hard to find [63688905], London, United Kingdom.
Language: English . This book usually ship within 10-15 business days and we will endeavor to dispatch orders quicker than this where possible. Brand New Book.
4
Symbolbild
0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar Disc (Classic Reprint) (2017)
EN PB NW RP
ISBN: 9780483774360 bzw. 0483774367, in Englisch, Forgotten Books, Taschenbuch, neu, Nachdruck.
Von Händler/Antiquariat, Ria Christie Collections [59718070], Uxbridge, United Kingdom.
PRINT ON DEMAND Book; New; Publication Year 2017; Not Signed; Fast Shipping from the UK.
PRINT ON DEMAND Book; New; Publication Year 2017; Not Signed; Fast Shipping from the UK.
5
0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar Disc (Classic Reprint) als von T. S. Papatheodoro
EN NW RP
ISBN: 9780483774360 bzw. 0483774367, in Englisch, Forgotten Books, neu, Nachdruck.
0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar Disc (Classic Reprint) ab 27.49 EURO.
Lade…