Bruno Codenotti – författare
Visar alla böcker från författaren Bruno Codenotti. Handla med fri frakt och snabb leverans.
3 produkter
3 produkter
326 kr
Skickas inom 10-15 vardagar
Il libro è la naturale continuazione di 'Introduzione alla complessità computazionale'. Il libro inizia affrontando il problema della primalità e della difficile identificazione della sua precisa complessità computazionale, per portarci all'analisi delle relazioni tra determinismo e casualità. Vengono poi presentati modelli di calcolo. Essempi ed esercizi aiutano il lettore ad impadronirsi degli strumenti matematici che vengono introdotti. Il testo può essere utilizzato per corsi universitari avanzati (in particolare del corso di laurea in Informatica) e per corsi di dottorato. Inoltre si propone come riferimento per i ricercatori del settore e di aree affini.
1 462 kr
Tillfälligt slut
This book presents the most important parallel algorithms for the solution of linear systems. Despite the evolution and significance of the field of parallel solution of linear systems, no book is completely dedicated to the subject. People interested in the themes covered by this book belong to two different groups: numerical linear algebra and theoretical computer science, and this is the first effort to produce a useful tool for both. The book is organized as follows: after introducing the general features of parallel algorithms and the most important models of parallel computation, the authors analyze the complexity of solving linear systems in the circuit, PRAM, distributed, and VLSI models. The approach covers both the general case (i.e. dense linear systems without structure) and many important special cases (i.e. banded, sparse, Toeplitz, circulant linear systems).
832 kr
Tillfälligt slut
This book presents the most important parallel algorithms for the solution of linear systems. Despite the evolution and significance of the field of parallel solution of linear systems, no book is completely dedicated to the subject. People interested in the themes covered by this book belong to two different groups: numerical linear algebra and theoretical computer science, and this is the first effort to produce a useful tool for both. The book is organized as follows: after introducing the general features of parallel algorithms and the most important models of parallel computation, the authors analyze the complexity of solving linear systems in the circuit, PRAM, distributed, and VLSI models. The approach covers both the general case (i.e. dense linear systems without structure) and many important special cases (i.e. banded, sparse, Toeplitz, circulant linear systems).