Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach - Oxford Lecture Series in Mathematics and Its Applications - Karpinski, Marek (Chair Professor of Computer Science, Chair Professor of Computer Science, University of Bonn, Germany) - Grāmatas - Oxford University Press - 9780198501626 - 1998. gada 26. marts
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

Karpinski, Marek (Chair Professor of Computer Science, Chair Professor of Computer Science, University of Bonn, Germany)
Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach - Oxford Lecture Series in Mathematics and Its Applications

Cena
€ 226,99

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 30. okt. - . gada 13. nov.
Ziemassvētku dāvanas var atgriezt līdz 31. janvārim
Saņemiet paziņojumus par jauniem Karpinski, Marek (Chair Professor of Computer Science, Chair Professor of Computer Science, University of Bonn, Germany) izdevumiem

Mūsu klienti saka:

14 dienu atgriešanas politika saskaņā ar Eiropas patērētāju tiesību aizsardzības likumu
Top vieta Trustpilot
Pievienot savam iMusic vēlmju sarakstam

Not rated yet

Part of the OXFORD LECTURE SERIES IN MATHEMATICS AND ITS APPLICATIONS series, a comprehensive and straightforward introduction to the basic methods of designing efficient parallel algorithms for graph matching problems. Appropriate for students at undergraduate level.

224 pages, line figures

Mediji Grāmatas     Hardcover Book   (Grāmata ar cieto muguriņu un vāku)
Izlaists 1998. gada 26. marts
ISBN13 9780198501626
Izdevēji Oxford University Press
Lapas 224
Izmēri 161 × 242 × 17 mm   ·   463 g
Valoda Angļu  

Vairāk no tā paša izdevēja

Skatīt visus Karpinski, Marek (Chair Professor of Computer Science, Chair Professor of Computer Science, University of Bonn, Germany)