Boolean Functions and Computation Models - Couverture souple

Clote, Peter; Kranakis, Evangelos

9783642082177: Boolean Functions and Computation Models

Couverture souple

ISBN 10 : 3642082173 ISBN 13 : 9783642082177

Editeur : Springer, 2010

Afficher les exemplaires de cette �dition comportant l?ISBN

1 D'occasion

De EUR 144,77

6 Neuf

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.

Les informations fournies dans la section � Synopsis � peuvent faire r�f�rence � une autre �dition de ce titre.

�diteurSpringer
Date d'�dition2010
ISBN 10 3642082173
ISBN 13 9783642082177
ReliureBroch�
Langueanglais
Nombre de pages620
Coordonn�es du fabricantnon disponible

Acheter D'occasion

�tat : Comme neuf

Like New

Afficher cet article

EUR 144,77

Autre devise

EUR 29,78 exp�dition depuis Royaume-Uni vers France

Destinations, frais et d�lais

Ajouter au panier

Acheter neuf

Afficher cet article

EUR 70,84

Autre devise

EUR 9,70 exp�dition depuis Allemagne vers France

Destinations, frais et d�lais

Ajouter au panier

Autres �ditions populaires du m�me titre

9783540594369: Boolean Functions and Computation Models

Edition pr�sent�e

ISBN 10 : 3540594361 ISBN 13 : 9783540594369
Editeur : Springer-Verlag Berlin and Heide..., 2002
Couverture rigide

R�sultats de recherche pour Boolean Functions and Computation Models

Image fournie par le vendeur

Boolean Functions and Computation Models

Peter Clote|Evangelos Kranakis

Edit� par Springer Berlin Heidelberg, 2010

ISBN 10 : 3642082173 ISBN 13 : 9783642082177

Neuf Couverture souple

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Etat : 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 r�f. du vendeur 5047262

Contacter le vendeur

Acheter neuf

EUR 70,84

Autre devise

Frais de port : EUR 9,70

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Boolean Functions and Computation Models

Evangelos Kranakis

Edit� par Springer Berlin Heidelberg, 2010

ISBN 10 : 3642082173 ISBN 13 : 9783642082177

Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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 r�f. du vendeur 9783642082177

Contacter le vendeur

Acheter neuf

EUR 80,20

Autre devise

Frais de port : EUR 10,99

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Boolean Functions and Computation Models

Evangelos Kranakis

Edit� par Springer Berlin Heidelberg Okt 2010, 2010

ISBN 10 : 3642082173 ISBN 13 : 9783642082177

Neuf Taschenbuch

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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 r�f. du vendeur 9783642082177

Contacter le vendeur