Peter Clote, Evangelos Kranakis

Boolean Functions and Computation Models (eBook, PDF)

• Format: PDF

Produktbeschreibung

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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Berlin Heidelberg
• Seitenzahl: 602
• Erscheinungstermin: 9. März 2013
• Englisch
• ISBN-13: 9783662049433
• Artikelnr.: 53135309

Inhaltsangabe

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.

Rezensionen

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)