Boolean Functions and Computation Models - Brossura
Libro 10 di 44: Texts in Theoretical Computer Science. An EATCS
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Dalla quarta di copertina
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Altre edizioni note dello stesso titolo
Risultati della ricerca per Boolean Functions and Computation Models
Foto dell'editore
Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)
Editore:
Springer Berlin Heidelberg 2002-09-19, 2002
ISBN 10: 3642082173
ISBN 13: 9783642082177
Nuovo
Paperback
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: New. Codice articolo 6666-IUK-9783642082177
Compra nuovo
EUR 84,47
EUR 17,63 shipping
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 10 disponibili
Immagini fornite dal venditore
Boolean Functions and Computation Models
Editore:
Springer Berlin Heidelberg Okt 2010, 2010
ISBN 10: 3642082173
ISBN 13: 9783642082177
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783642082177
Compra nuovo
EUR 80,20
EUR 23,00 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Foto dell'editore
Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Mar3113020216903
Compra nuovo
EUR 101,78
EUR 3,39 shipping
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Boolean Functions and Computation Models
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 620. Codice articolo 262143549
Compra nuovo
EUR 110,98
EUR 3,39 shipping
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 4 disponibili
Immagini fornite dal venditore
Boolean Functions and Computation Models
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 4 su 5 stelle
Condizione: 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. Codice articolo 5047262
Compra nuovo
EUR 70,29
EUR 48,99 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Boolean Functions and Computation Models
Print on DemandDa: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 4 su 5 stelle
Condizione: New. Print on Demand pp. 620 19 Illus. Codice articolo 5704418
Compra nuovo
EUR 113,96
EUR 7,40 shipping
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 4 disponibili
Foto dell'editore
Boolean Functions and Computation Models
Print on DemandDa: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 4 su 5 stelle
Condizione: New. PRINT ON DEMAND pp. 620. Codice articolo 182143543
Compra nuovo
EUR 117,74
EUR 9,95 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 4 disponibili
Immagini fornite dal venditore
Boolean Functions and Computation Models
Editore:
Springer Berlin Heidelberg, Springer Okt 2010, 2010
ISBN 10: 3642082173
ISBN 13: 9783642082177
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783642082177
Compra nuovo
EUR 80,20
EUR 60,00 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Boolean Functions and Computation Models
Da: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Boolean Functions and Computation Models | Evangelos Kranakis (u. a.) | Taschenbuch | xiv | Englisch | 2010 | Springer-Verlag GmbH | EAN 9783642082177 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Codice articolo 107023034
Compra nuovo
EUR 73,05
EUR 70,00 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 5 disponibili
Immagini fornite dal venditore
Boolean Functions and Computation Models
Editore:
Springer Berlin Heidelberg, 2010
ISBN 10: 3642082173
ISBN 13: 9783642082177
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783642082177
Compra nuovo
EUR 80,20
EUR 64,63 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili