Limits to Parallel Computation : P-Completeness Theory

16,380 TWD
KPC會員價
14,742
English

產品說明

This volume provides an ideal introduction to key topics in parallel computing. With its cogent overview of the essentials of the subject as well as lists of P -complete- and open problems, extensive remarks corresponding to each problem, a thorough index, and extensive references, the book will prove invaluable to programmers stuck on problems that are particularly difficult to parallelize. In providing an up-to-date survey of parallel computing research from 1994, Topics in Parallel Computing will prove invaluable to researchers and professionals with an interest in the super computers of the future.

This monograph focuses on one important topic of parallel computation: the complexity of problems that appear to be difficult to parallelize. The authors present in one reference all of the current definitions and research results in the area.

開放訂購

預計出貨時間約 3-4 weeks

我們已盡力確保庫存狀態正確,但偶爾仍可能會出現顯示狀態不符的情況。實際庫存狀況仍需以現場及供應商是否可提供為主。

訂單金額滿 1,000TWD 即可享有國內免運費優惠

折扣將於結帳時套用。

最近瀏覽過的項目

相關產品