Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series) - Tapa blanda

Clote, Peter; Kranakis, Evangelos

9783642082177: Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)

Tapa blanda

ISBN 10: 3642082173 ISBN 13: 9783642082177

Editorial: Springer, 2010

Ver todas las copias de esta edici�n del ISBN

1 Usado

De EUR 143,93

6 Nuevo

De EUR 70,84

This advanced textbook surveys research on boolean functions, circuits, parallel computation models, function algebras, and proof systems, with an overriding focus on the structure of "fast" parallel computation.

"Sinopsis" puede pertenecer a otra edici�n de este libro.

De la contraportada

This textbook presents a survey of research on boolean functions, circuits, parallel computation models, function algebras, and proof systems. Its main aim is to elucidate the structure of "fast" parallel computation. The complexity of parallel computation is emphasized through a variety of techniques ranging from finite combinatorics, probability theory, and finite group theory to finite model theory and proof theory. Nonuniform computation models are studied in the form of boolean circuits, uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems.
The book will benefit advanced undergraduate and graduate students as well as researchers in the field of complexity theory.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

EditorialSpringer
A�o de publicaci�n2010
ISBN 10 3642082173
ISBN 13 9783642082177
Encuadernaci�nTapa blanda
IdiomaIngl�s
N�mero de p�ginas620
Contacto del fabricanteno disponible

Comprar usado

Condici�n: Como Nuevo

Like New

Ver este art�culo

EUR 143,93

Convertir moneda

EUR 29,61 gastos de env�o desde Reino Unido a Espa�a

Destinos, gastos y plazos de env�o

A�adir al carrito

Comprar nuevo

Ver este art�culo

EUR 70,84

Convertir moneda

EUR 19,49 gastos de env�o desde Alemania a Espa�a

Destinos, gastos y plazos de env�o

A�adir al carrito

Otras ediciones populares con el mismo t�tulo

9783540594369: Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)

Edici�n Destacada

ISBN 10: 3540594361 ISBN 13: 9783540594369
Editorial: Springer, 2002
Tapa dura

Resultados de la b�squeda para Boolean Functions and Computation Models (Texts in...

Imagen del vendedor

Boolean Functions and Computation Models

Peter Clote|Evangelos Kranakis

Publicado por Springer Berlin Heidelberg, 2010

ISBN 10: 3642082173 ISBN 13: 9783642082177

Nuevo Tapa blanda

Impresi�n bajo demanda

Librería: moluna, Greven, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Condici�n: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A survey of the present state of the art by internationally well-known authorsFocus on fast parallel computationIncludes numerous exercises ranging in difficultyA survey of the present state of the art by internationally well-known authors. N� de ref. del art�culo: 5047262

Contactar al vendedor

Comprar nuevo

EUR 70,84

Convertir moneda

Gastos de env�o: EUR 19,49

De Alemania a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: M�s de 20 disponibles

A�adir al carrito

Imagen del vendedor

Boolean Functions and Computation Models

Evangelos Kranakis

Publicado por Springer Berlin Heidelberg Okt 2010, 2010

ISBN 10: 3642082173 ISBN 13: 9783642082177

Nuevo Taschenbuch

Impresi�n bajo demanda

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 two internationally renowned authors elucidate the structure of 'fast' parallel computation. Its complexity is emphasised through a variety of techniques ranging from finite combinatorics, probability theory and finite group theory to finite model theory and proof theory. Non-uniform computation models are studied in the form of Boolean circuits; uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems. Providing a survey of research in the field, the book will benefit advanced undergraduates and graduate students as well as researchers. This textbook presents a survey of research on boolean functions, circuits, parallel computation models, function algebras, and proof systems. Its main aim is to elucidate the structure of 'fast' parallel computation. The complexity of parallel computation is emphasized through a variety of techniques ranging from finite combinatorics, probability theory, and finite group theory to finite model theory and proof theory. Nonuniform computation models are studied in the form of boolean circuits, uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems.The book will benefit advanced undergraduate and graduate students as well as researchers in the field of complexity theory. 620 pp. Englisch. N� de ref. del art�culo: 9783642082177

Contactar al vendedor

Comprar nuevo

EUR 80,20

Convertir moneda

Gastos de env�o: EUR 11,00

De Alemania a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: 2 disponibles

A�adir al carrito

Imagen del vendedor

Boolean Functions and Computation Models

Evangelos Kranakis

Publicado por Springer Berlin Heidelberg, 2010

ISBN 10: 3642082173 ISBN 13: 9783642082177

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 foundations of computational complexity theory go back to Alan Thring in the 1930s who was concerned with the existence of automatic procedures deciding the validity of mathematical statements. The first example of such a problem was the undecidability of the Halting Problem which is essentially the question of debugging a computer program: Will a given program eventu ally halt Computational complexity today addresses the quantitative aspects of the solutions obtained: Is the problem to be solved tractable But how does one measure the intractability of computation Several ideas were proposed: A. Cobham [Cob65] raised the question of what is the right model in order to measure a 'computation step' , M. Rabin [Rab60] proposed the introduction of axioms that a complexity measure should satisfy, and C. Shannon [Sha49] suggested the boolean circuit that computes a boolean function. However, an important question remains: What is the nature of computa tion In 1957, John von Neumann [vN58] wrote in his notes for the Silliman Lectures concerning the nature of computation and the human brain that . . . logics and statistics should be primarily, although not exclusively, viewed as the basic tools of 'information theory'. Also, that body of experience which has grown up around the planning, evaluating, and coding of complicated logical and mathematical automata will be the focus of much of this information theory. The most typical, but not the only, such automata are, of course, the large electronic computing machines. N� de ref. del art�culo: 9783642082177

Contactar al vendedor