UID:
almahu_9948233651402882
Format:
1 online resource (201 pages) :
,
digital, PDF file(s).
ISBN:
9780511526633 (ebook)
Series Statement:
London Mathematical Society lecture note series ; 169
Content:
By 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.
Note:
Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Additional Edition:
Print version: ISBN 9780521408264
Language:
English
URL:
https://doi.org/10.1017/CBO9780511526633
