Artículos relacionados a Communication Complexity and Parallel Computing (Texts...
Communication Complexity and Parallel Computing (Texts in Theoretical Computer Science. An EATCS Series) - Tapa blanda
Sinopsis
This book shows how to establish the communication complexity of distinct computing problems and to apply this knowledge in parallel processing of computing problems. It gives also a survey of this special topic and includes motivation for further research.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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 problems the proved lower bounds are useful for proving the optimality of algorithms that are already designed. In some cases the knowledge about the communication complexity of a given problem may be even helpful in searching for efficient algorithms to this problem. The study of communication complexity becomes a well-defined indepen dent area of complexity theory. In addition to a strong relation to several funda mental complexity measures (and so to several fundamental problems of com plexity theory) communication complexity has contributed to the study and to the understanding of the nature of determinism, nondeterminism, and random ness in algorithmics. There already exists a non-trivial mathematical machinery to handle the communication complexity of concrete computing problems, which gives a hope that the approach based on communication complexity will be in strumental in the study of several central open problems of recent complexity theory.
Reseña del editor
This book is devoted to the investigation of a special topic in theoretical computer science - communication complexity as an abstract measure of the complexity of computing problems. Its main aim is to show how the theoretical study of communication complexity can be useful in the process of designing effective parallel algorithms. The author shows how to get important information about the parallel complexity (parallel time, the number of processors, the descriptional complexity of the topology of the parallel architecture) of specific computing problems from knowledge of their communication complexity. The book is written as a textbook for undergraduate and graduate students and provides a careful explanation of the subject as well as motivation for further research.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 109,45
EUR 28,88 gastos de envío desde Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envíoComprar nuevo
Ver este artículo
EUR 66,13
EUR 3,41 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoOtras ediciones populares con el mismo título
Resultados de la búsqueda para Communication Complexity and Parallel Computing (Texts...
Imagen de archivo
Communication Complexity and Parallel Computing (Texts in Theoretical Computer Science. An EATCS Series)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020216877
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Communication Complexity and Parallel Computing (Texts in Theoretical Computer Science. An EATCS Series)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783642081859_new
Gastos de envío:
EUR 13,84
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Communication Complexity and Parallel Computing
Publicado por
Springer Berlin Heidelberg Dez 2010, 2010
ISBN 10: 3642081851
ISBN 13: 9783642081859
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 problems the proved lower bounds are useful for proving the optimality of algorithms that are already designed. In some cases the knowledge about the communication complexity of a given problem may be even helpful in searching for efficient algorithms to this problem. The study of communication complexity becomes a well-defined indepen dent area of complexity theory. In addition to a strong relation to several funda mental complexity measures (and so to several fundamental problems of com plexity theory) communication complexity has contributed to the study and to the understanding of the nature of determinism, nondeterminism, and random ness in algorithmics. There already exists a non-trivial mathematical machinery to handle the communication complexity of concrete computing problems, which gives a hope that the approach based on communication complexity will be in strumental in the study of several central open problems of recent complexity theory. 352 pp. Englisch. Nº de ref. del artículo: 9783642081859
Gastos de envío:
EUR 23,00
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 2 disponibles
Imagen de archivo
Communication Complexity and Parallel Computing
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 352. Nº de ref. del artículo: 263075832
Cantidad disponible: 4 disponibles
Imagen de archivo
Communication Complexity and Parallel Computing
Impresión bajo demandaLibrería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Print on Demand pp. 352 40 Illus. Nº de ref. del artículo: 5853479
Gastos de envío:
EUR 7,51
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 4 disponibles
Imagen de archivo
Communication Complexity and Parallel Computing
Impresión bajo demandaLibrería: Biblios, Frankfurt am main, HESSE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. PRINT ON DEMAND pp. 352. Nº de ref. del artículo: 183075826
Gastos de envío:
EUR 9,95
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 4 disponibles
Imagen del vendedor
Communication Complexity and Parallel Computing
Publicado por
Springer Berlin Heidelberg, 2010
ISBN 10: 3642081851
ISBN 13: 9783642081859
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 5047232
Gastos de envío:
EUR 48,99
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Communication Complexity and Parallel Computing
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Dez 2010, 2010
ISBN 10: 3642081851
ISBN 13: 9783642081859
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Neuware -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 problems the proved lower bounds are useful for proving the optimality of algorithms that are already designed. In some cases the knowledge about the communication complexity of a given problem may be even helpful in searching for efficient algorithms to this problem. The study of communication complexity becomes a well-defined indepen dent area of complexity theory. In addition to a strong relation to several funda mental complexity measures (and so to several fundamental problems of com plexity theory) communication complexity has contributed to the study and to the understanding of the nature of determinism, nondeterminism, and random ness in algorithmics. There already exists a non-trivial mathematical machinery to handle the communication complexity of concrete computing problems, which gives a hope that the approach based on communication complexity will be in strumental in the study of several central open problems of recent complexity theory.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 352 pp. Englisch. Nº de ref. del artículo: 9783642081859
Gastos de envío:
EUR 60,00
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 2 disponibles
Imagen del vendedor
Communication Complexity and Parallel Computing
Publicado por
Springer Berlin Heidelberg, 2010
ISBN 10: 3642081851
ISBN 13: 9783642081859
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 problems the proved lower bounds are useful for proving the optimality of algorithms that are already designed. In some cases the knowledge about the communication complexity of a given problem may be even helpful in searching for efficient algorithms to this problem. The study of communication complexity becomes a well-defined indepen dent area of complexity theory. In addition to a strong relation to several funda mental complexity measures (and so to several fundamental problems of com plexity theory) communication complexity has contributed to the study and to the understanding of the nature of determinism, nondeterminism, and random ness in algorithmics. There already exists a non-trivial mathematical machinery to handle the communication complexity of concrete computing problems, which gives a hope that the approach based on communication complexity will be in strumental in the study of several central open problems of recent complexity theory. Nº de ref. del artículo: 9783642081859
Gastos de envío:
EUR 62,67
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles
Imagen de archivo
Communication Complexity and Parallel Computing (Texts in Theoretical Computer Science. An EATCS Series)
Librería: Mispah books, Redhill, SURRE, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: Like New. Like New. book. Nº de ref. del artículo: ERICA75836420818515
Gastos de envío:
EUR 28,88
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles