Reviews for Complexity Of Boolean Functions

The average rating for Complexity Of Boolean Functions based on 2 reviews is 3.5 stars.

Review # 1 was written on 2009-02-22 00:00:00 G F Willmetts 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!

Review # 2 was written on 2014-10-21 00:00:00 Trevor Gray a good book to learn