TY  - BOOK
AU  - Paterson,Michael S.
TI  - Boolean function complexity / 
SN  - 0521408261
AV  - QA 267.7 .B66 1992
U1  - 511.3/24 20
PY  - 1992///
CY  - Cambridge, New York, NY, USA
PB  - Cambridge University Press
KW  - Computational complexity
KW  - Congresses
KW  - Algebra, Boolean
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)
UR  - http://www.loc.gov/catdir/description/cam026/93111192.html
UR  - http://www.loc.gov/catdir/toc/cam027/93111192.html
ER  -