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 ...
Read More
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.
Read Less
Add this copy of Boolean Function Complexity to cart. $48.47, new condition, Sold by Booksplease rated 3.0 out of 5 stars, ships from Southport, MERSEYSIDE, UNITED KINGDOM, published 1992 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Trade paperback (US). Contains: Unspecified. London Mathematical Society Lecture Note Series . Includes unspecified. Intended for professional and scholarly audience.
Add this copy of Boolean Function Complexity to cart. $51.88, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 1992 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Print on demand Trade paperback (US). Contains: Unspecified. London Mathematical Society Lecture Note Series . Includes unspecified. Intended for professional and scholarly audience.
Add this copy of Boolean Function Complexity (London Mathematical to cart. $75.15, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 1992 by Cambridge University Press.
