Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
From the Back Cover
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.
"About this title" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Boolean Functions and Computation Models (Texts in...
Stock Image
Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783642082177_new
Buy New
£ 72.13
Shipping:
£ 11.98
From United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)
Published by
Springer Berlin Heidelberg 2002-09-19, 2002
ISBN 10: 3642082173
ISBN 13: 9783642082177
New
Paperback
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: New. Seller Inventory # 6666-IUK-9783642082177
Buy New
£ 72.05
Shipping:
£ 15.49
From United Kingdom to U.S.A.
Quantity: 10 available
Seller Image
Boolean Functions and Computation Models
Published by
Springer Berlin Heidelberg Okt 2010, 2010
ISBN 10: 3642082173
ISBN 13: 9783642082177
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783642082177
Stock Image
Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020216903
Stock Image
Boolean Functions and Computation Models
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 620. Seller Inventory # 262143549
Seller Image
Boolean Functions and Computation Models
Published by
Springer Berlin Heidelberg, 2010
ISBN 10: 3642082173
ISBN 13: 9783642082177
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: 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. Seller Inventory # 5047262
Stock Image
Boolean Functions and Computation Models
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. Print on Demand pp. 620 19 Illus. Seller Inventory # 5704418
Stock Image
Boolean Functions and Computation Models
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 620. Seller Inventory # 182143543
Seller Image
Boolean Functions and Computation Models
Published by
Springer Berlin Heidelberg, Springer Okt 2010, 2010
ISBN 10: 3642082173
ISBN 13: 9783642082177
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 620 pp. Englisch. Seller Inventory # 9783642082177
Seller Image
Boolean Functions and Computation Models
Published by
Springer Berlin Heidelberg, 2010
ISBN 10: 3642082173
ISBN 13: 9783642082177
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783642082177