LMS: 169 Boolean Function Complexty (London Mathematical Society Lecture Note Series, Series Number 169) - Softcover

Paterson, M. S.

Softcover

ISBN 10: 0521408261 ISBN 13: 9780521408264

Publisher: Cambridge University Press, 2008

Synopsis

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.

About this title

Book Description

Boolean function complexity has seen exciting advances in the last few years. It is a long established area of discrete mathematics which uses combinatorial and occasionally algebraic methods.

Edition details

• Publisher: Cambridge University Press
• Publication date: 2008
• Language: English
• ISBN 10: 0521408261
• ISBN 13: 9780521408264
• Binding: Paperback
• Number of pages: 212