1300 36 33 32

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.

Buy Boolean Function Complexity book by M. S. Paterson from Australia's Online Bookstore, Boomerang Books.

Book Details

ISBN: 9780521408264
ISBN-10: 0521408261
Format: Paperback
(228mm x 152mm x 12mm)
Pages: 212
Imprint: Cambridge University Press
Publisher: Cambridge University Press
Publish Date: 5-Nov-1992
Country of Publication: United Kingdom

Reviews

» Have you read this book? We'd like to know what you think about it - write a review about Boolean Function Complexity book by M. S. Paterson and you'll earn 50c in Boomerang Bucks loyalty dollars (you must be a member - it's free to sign up!)

Write Review