11. The NAND gate is significant because any boolean function can be implemented by using a combination of NAND gates. 12. The boolean function \ rho is the principal component of the regularity 4-tuple, which is defined as 13. Minimizing Boolean functions by hand using the classical Karnaugh maps is a laborious, tedious and error prone process. 14. The largeness condition requires that the property hold for a sufficiently large fraction of the set of all boolean functions . 15. Thus, identity of Boolean functions computed by read-once branching programs can be reduced to polynomial identity testing. 16. The only canonical way to do this is to extend it with " all " possible Boolean functions . 17. In addition to storing states and performing Boolean functions , these structures can interact, create, and destroy static structures. 18. Each gate corresponds to some Boolean function that takes a fixed number of bits as input and outputs a single bit. 19. A knowledge of the length of the shift register and the boolean function of the gates will yield the PR pattern. 20. Any particular Boolean function can be represented by one and only one full disjunctive normal form, one of the canonical forms.
