000			02045nam a22003498i 4500
001			CR9780511526633
003			UkCbUP
005			20200124160229.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			090407s1992||||enk o ||1 0|eng|d
020			_a9780511526633 (ebook)
020			_z9780521408264 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA267.7 _b.B66 1992
082	0	0	_a511.3/24 _220
245	0	0	_aBoolean function complexity / _cedited by M.S. Paterson.
264		1	_aCambridge : _bCambridge University Press, _c1992.
300			_a1 online resource (201 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	1		_aLondon Mathematical Society lecture note series ; _v169
500			_aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
520			_aBy considering the size of the logical network needed to perform a given computational task, the intrinsic difficulty of that task can be examined. Boolean function complexity, the combinatorial study of such networks, is a subject that started back in the 1950s and has today become one of the most challenging and vigorous areas of theoretical computer science. The papers in this book stem from the London Mathematical Society Symposium on Boolean Function Complexity held at Durham University in July 1990. The range of topics covered will be of interest to the newcomer to the field as well as the expert, and overall the papers are representative of the research presented at the Symposium. Anyone with an interest in Boolean Function complexity will find that this book is a necessary purchase.
650		0	_aComputational complexity _vCongresses.
650		0	_aAlgebra, Boolean.
700	1		_aPaterson, Michael S., _eeditor.
776	0	8	_iPrint version: _z9780521408264
830		0	_aLondon Mathematical Society lecture note series ; _v169.
856	4	0	_uhttps://doi.org/10.1017/CBO9780511526633
999			_c517422 _d517420