Communication Complexity and Parallel Computing
The communication complexity of two-party protocols is an only 15 years old complexity measure, but it is already considered to be one of the fundamen tal complexity measures of recent complexity theory. Similarly to Kolmogorov complexity in the theory of sequential computations, communication complex ity is used as a method for the study of the complexity of concrete computing problems in parallel information processing. Especially, it is applied to prove lower bounds that say what computer resources (time, hardware, memory size) are necessary to compute the given task. Besides the estimation of the compu tational difficulty of computing…
Mehr
CHF 72.00
Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)
V104:
Folgt in ca. 10 Arbeitstagen
Produktdetails
- ISBN: 978-3-540-57459-0
- EAN: 9783540574590
- Produktnummer: 4033311
- Verlag: Springer Berlin Heidelberg
- Sprache: Englisch
- Erscheinungsjahr: 1997
- Seitenangabe: 356 S.
- Masse: H24.1 cm x B16.0 cm x D2.5 cm 644 g
- Auflage: 1997
- Abbildungen: HC runder Rücken kaschiert
- Gewicht: 644
66 weitere Werke von Juraj Hromkovic:
Bewertungen
Anmelden