TY  - BOOK
AU  - Paterson, Michael S
TI  - Boolean function complexity
SN  - 521408261
SN  - 93111192
U1  - 511.324 PAT 
PY  - 1992///
CY  - Cambridge
PB  - Cambridge University Press
KW  - Algebra, Boolean
KW  - Computational complexity - Congresses
N1  - Papers from the Symposium on Boolean Function Complexity, held July, 1990, at Durham University and sponsored by the London Mathematical Society. Includes bibliographical references (p. 198-201)
ER  -