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 Karpinski, Marek (Chair Professor of Computer Science, Chair Professor of Computer Science, University of Bonn, Germany)

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

Pris

NOK 2.209

Bestillingsvarer

Forventes levert 7. - 16. jan 2026

Julegaver kan byttes frem til 31. januar

Kundene våre sier:

Top-vurdering på Google Reviews, baseret på tusinder af anmeldelser.

14 dages returrett

Toppvurdering på Trustpilot

Legg til iMusic ønskeliste

eller

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)

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

Media	Bøker Innbunden bok (Bok med hard rygg og stivt omslag)
Utgitt	26. mars 1998
ISBN13	9780198501626
Utgivere	Oxford University Press
Antall sider	224
Mål	161 × 242 × 17 mm · 463 g
Språk	Engelsk

Se alt med Karpinski, Marek (Chair Professor of Computer Science, Chair Professor of Computer Science, University of Bonn, Germany) ( f.eks. Innbunden bok )