Warenkorb
€ 0,00 0 Buch dabei,
portofrei
Boolean Functions and Computation Models als Buch
PORTO-
FREI

Boolean Functions and Computation Models

'Texts in Theoretical Computer Science. An EATCS Series'. 2002. Auflage. 2 schwarz-weiße Abbildungen,…
Buch (gebunden)
Ihr 12%-Rabatt auf alle Spielwaren, Hörbücher, Filme, Musik u.v.m
 
12% Rabatt sichern mit Gutscheincode: KINDER12
 
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 compu… weiterlesen
Dieses Buch ist auch verfügbar als:
Buch

99,99*

inkl. MwSt.
Portofrei
Sofort lieferbar
Boolean Functions and Computation Models als Buch

Produktdetails

Titel: Boolean Functions and Computation Models
Autor/en: Peter Clote, Evangelos Kranakis

ISBN: 3540594361
EAN: 9783540594369
'Texts in Theoretical Computer Science. An EATCS Series'.
2002. Auflage.
2 schwarz-weiße Abbildungen, Bibliographie.
Book.
Sprache: Englisch.
Springer-Verlag GmbH

19. September 2002 - gebunden - xiv

Beschreibung

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 undergraduates and graduate students as well as researchers in the field of complexity theory.

Inhaltsverzeichnis


1. Boolean Functions and Circuits.-
2. Circuit Lower Bounds.-
3. Circuit Upper Bounds.-
4. Randomness and Satisfiability.-
5. Propositional Proof Systems.-
6. Machine Models and Function Algebras.-
7. Higher Types.- References.

Pressestimmen

From the reviews: "The monograph gives the most recent and complete description of lower bounds for depth-restricted circuits, and propositional proof systems. ... the authors present a research monograph on important subjects and provide many very recent results. I would recommend it for any university library and also for researchers." (Ingo Wegener, The Computer Journal, Vol. 46 (3), 2003)
Servicehotline
089 - 70 80 99 47

Mo. - Fr. 8.00 - 20.00 Uhr
Sa. 10.00 - 20.00 Uhr
Filialhotline
089 - 30 75 75 75

Mo. - Sa. 9.00 - 20.00 Uhr
Bleiben Sie in Kontakt:
Sicher & bequem bezahlen:
akzeptierte Zahlungsarten: Überweisung, offene Rechnung,
Visa, Master Card, American Express, Paypal
Zustellung durch:
* Alle Preise verstehen sich inkl. der gesetzlichen MwSt. Informationen über den Versand und anfallende Versandkosten finden Sie hier.
** im Vergleich zum dargestellten Vergleichspreis.