TalkingTech
The view from the top of IT with TechWorld Editor Rohan Pearce
The Minimimization of Boolean Functions.
The Design of Efficient Circuits for Some Fundamental Functions.
Asymptotic Results and Universal Circuits.
Lower Bounds on Circuit Complexity.
Monotone Circuits.
Relations between Circuit Size, Formula Size and Depth.
Formula Size.
Circuits and other Non-Uniform Computation Methods vs.
Turing Machines and other Uniform Computation Models.
Hierarchies, Mass Production, and Reductions.
Bounded-Depth Circuits.
Synchronous, Planar, and Probabilistic Circuits.
PRAMs and WRAMs: Parallel Random Access Machines.
Branching Programs.
References.
Index.
Recent comments
35 minutes ago
5 hours, 28 minutes ago
8 hours, 21 minutes ago
9 hours, 21 minutes ago
11 hours, 2 minutes ago
21 hours, 3 minutes ago
1 day, 7 hours ago
1 day, 19 hours ago
1 day, 19 hours ago
2 days, 5 hours ago