Finding the Closest Pair of Points (Divide and Conquer) / Libristo.pl
Finding the Closest Pair of Points (Divide and Conquer)

Code: 02283635

Finding the Closest Pair of Points (Divide and Conquer)

by Thomas Hoffmann

Studienarbeit aus dem Jahr 2012 im Fachbereich Informatik - Theoretische Informatik, Note: 1,0, Karlsruher Institut für Technologie (KIT), Sprache: Deutsch, Abstract: In folgender Ausarbeitung wird ein effizienter Divide & Conquer ... more

71.04 zł

RRP: 74.85 zł

You save 3.82 zł


In stock at our supplier
Shipping in 8 - 10 days
Add to wishlist

You might also like

Give this book as a present today
  1. Order book and choose Gift Order.
  2. We will send you book gift voucher at once. You can give it out to anyone.
  3. Book will be send to donee, nothing more to care about.

Book gift voucher sampleRead more

More about Finding the Closest Pair of Points (Divide and Conquer)

You get 41 loyalty points

Book synopsis

Studienarbeit aus dem Jahr 2012 im Fachbereich Informatik - Theoretische Informatik, Note: 1,0, Karlsruher Institut für Technologie (KIT), Sprache: Deutsch, Abstract: In folgender Ausarbeitung wird ein effizienter Divide & Conquer-Algorithmus zur Bestimmung desjenigen Punktepaares, welches unter einer Menge von Punkten den geringsten Abstand zueinander aufweist, vorgestellt.

Book details

71.04 zł

Trending among others

All about us



Shopping guide
Digest
Books by language

250 000
safisfied customers

Since 2008, we have served long line of book lovers, but each of them was always on the first place.

Payment
Delivery 12.99 zł
Paczkomat 12,99 ZŁ 31975 punktów
Polska
България Hrvatska România Magyarország Slovensko Česko

Copyright! ©2008-24 libristo.pl All rights reservedPrivacyPoučení o cookies

Account: Log in
Wszystkie książki świata w jednym miejscu. I co więcej w super cenach.

Shopping cart ( Empty )

For free shipping
shop for 299 zł and more

You are here: