| 000 | 00811nam a2200217Ia 4500 | ||
|---|---|---|---|
| 008 | 191130s1992##################000#0#eng## | ||
| 020 | _a521408261 | ||
| 022 | _a93111192 | ||
| 040 |
_aACL _cACL |
||
| 082 | _a511.324 PAT | ||
| 245 |
_aBoolean function complexity _cedited by M.S. Paterson |
||
| 260 |
_aCambridge _bCambridge University Press _c1992 |
||
| 300 | _a201 p. : ill. ; 23 cm. | ||
| 500 | _aPapers 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) | ||
| 650 | _aAlgebra, Boolean | ||
| 650 | _aComputational complexity - Congresses | ||
| 700 | _aPaterson, Michael S | ||
| 990 | _ab91e198bac10000c6651e164910c875c | ||
| 991 | _a112636 | ||
| 999 |
_c118579 _d118579 |
||