Boolean Function Complexity (Paperback, New)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	London Mathematical Society Lecture Note Series
Release date:	November 1992
First published:	1992
Editors:	M. S. Paterson
Dimensions:	229 x 152 x 12mm (L x W x T)
Format:	Paperback - Trade
Pages:	212
Edition:	New
ISBN-13:	978-0-521-40826-4
Categories:	Books > Science & Mathematics > Mathematics > Mathematical foundations > Mathematical logic Promotions
LSN:	0-521-40826-1
Barcode:	9780521408264

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!