Articles liés à Boolean Functions and Computation Models
L'édition de cet ISBN n'est malheureusement plus disponible.
Afficher les exemplaires de cette édition ISBN
- ÉditeurSpringer
- Date d'édition2010
- ISBN 10 3642082173
- ISBN 13 9783642082177
- ReliureBroché
- Nombre de pages620
Acheter neuf
En savoir plus sur cette édition
EUR 88,57
Frais de port :
EUR 11,64
De Royaume-Uni vers Etats-Unis
Meilleurs résultats de recherche sur AbeBooks
Image d'archives
Boolean Functions and Computation Models
Edité par
Springer
(2010)
ISBN 10 : 3642082173
ISBN 13 : 9783642082177
Neuf
Couverture souple
Quantité disponible : > 20
Vendeur :
Evaluation vendeur
Description du livre Etat : New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. N° de réf. du vendeur ria9783642082177_lsuk
Acheter neuf
EUR 88,57
Autre devise
Image d'archives
Boolean Functions and Computation Models
Edité par
Springer 2010-10
(2010)
ISBN 10 : 3642082173
ISBN 13 : 9783642082177
Neuf
PF
Quantité disponible : 10
Vendeur :
Evaluation vendeur
Description du livre PF. Etat : New. N° de réf. du vendeur 6666-IUK-9783642082177
Acheter neuf
EUR 83,61
Autre devise
Image fournie par le vendeur
Boolean Functions and Computation Models
Edité par
Springer Berlin Heidelberg Okt 2010
(2010)
ISBN 10 : 3642082173
ISBN 13 : 9783642082177
Neuf
Taschenbuch
Quantité disponible : 2
Vendeur :
Evaluation vendeur
Description du livre 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
Acheter neuf
EUR 80,20
Autre devise
Image fournie par le vendeur
Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series) by Clote, Peter [Paperback ]
Edité par
Springer Berlin Heidelberg
(2010)
ISBN 10 : 3642082173
ISBN 13 : 9783642082177
Neuf
Soft Cover
Quantité disponible : 1
Vendeur :
Evaluation vendeur
Description du livre Soft Cover. Etat : new. N° de réf. du vendeur 9783642082177
Acheter neuf
EUR 107,57
Autre devise
Image d'archives
Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)
Edité par
Springer
(2010)
ISBN 10 : 3642082173
ISBN 13 : 9783642082177
Neuf
Couverture souple
Quantité disponible : > 20
Vendeur :
Evaluation vendeur
Description du livre Etat : New. N° de réf. du vendeur ABLIING23Mar3113020216903
Acheter neuf
EUR 111,30
Autre devise
Image fournie par le vendeur
Boolean Functions and Computation Models
Edité par
Springer Berlin Heidelberg
(2010)
ISBN 10 : 3642082173
ISBN 13 : 9783642082177
Neuf
Taschenbuch
Quantité disponible : 1
Vendeur :
Evaluation vendeur
Description du livre 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
Acheter neuf
EUR 84,55
Autre devise
Image fournie par le vendeur
Boolean Functions and Computation Models
Edité par
Springer Berlin Heidelberg
(2010)
ISBN 10 : 3642082173
ISBN 13 : 9783642082177
Neuf
Couverture souple
Quantité disponible : > 20
Vendeur :
Evaluation vendeur
Description du livre 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 difficultyThe two internationally renowned authors elucidate the structure of fast paralle. N° de réf. du vendeur 5047262
Acheter neuf
EUR 70,29
Autre devise