The Complexity of Boolean Functions

by Ingo Wegener

Presents a large number of recent research results previously unavailable in book form. Initially deals with the wee-known computation models, and goes on to special types of circuits, parallel computers, and branching programs. Includes basic theory as well recent research findings. Each chapter includes exercises.

Genres: Mathematics, Algebra

470 pages, Hardcover

First published August 12, 1987

Reviews

[Nick Black]

So I'm outside smoking a Newport and reading Donald E. Knuth, and what should I find on the top of page 125 (mmmm, perfect cubes (5^3, of course)) (Volume 4 Fascicle 0 Section 7.1.2) but a reference which might just advance my some of my research nicely (and likely a fine complement to that priceless tome, Hacker's Delight)! Unfortunately, it's a scrotumtightening $350 on Amazon or Alibris, but information after all does want to be free and Ingo has fulfilled the Categorical Imperative; a PostScript copy is freely available here. Thanks, Ingo, and thanks also to the Electronic Colloquium on Computational Complexity at Hasso-Plattner-Institut! w00t w00t!