000			01323cam a2200313 a 4500
999			_c24179 _d24179
001			4892491
003			OSt
005			20200130144848.0
008			930203s1992 enka b 100 0 eng
010			_a 93111192
020			_a0521408261
040			_aDLC _cDLC _dDLC
050	0	0	_aQA 267.7 _b.B66 1992
082	0	0	_a511.3/24 _220
245	0	0	_aBoolean function complexity / _cedited by M.S. Paterson.
260			_aCambridge ; _aNew York, NY, USA : _bCambridge University Press, _c1992.
300			_a201 p. : _bill. ; _c23 cm.
440		0	_aLondon Mathematical Society lecture note series ; _v169
500			_aPapers from the Symposium on Boolean Function Complexity, held July, 1990, at Durham University and sponsored by the London Mathematical Society.
504			_aIncludes bibliographical references (p. 198-201).
650		0	_aComputational complexity _xCongresses.
650		0	_aAlgebra, Boolean.
700	1		_aPaterson, Michael S.
856	4	2	_3Publisher description _uhttp://www.loc.gov/catdir/description/cam026/93111192.html
856	4	1	_3Table of contents _uhttp://www.loc.gov/catdir/toc/cam027/93111192.html
906			_a7 _bcbc _corignew _d2 _encip _f19 _gy-gencatlg
942			_2lcc _cBK