• Sign In / Register
  • Help
  • Basket0
Boolean Function Complexity - London Mathematical Society Lecture Note Series 169 (Paperback)
  • Boolean Function Complexity - London Mathematical Society Lecture Note Series 169 (Paperback)
zoom

Boolean Function Complexity - London Mathematical Society Lecture Note Series 169 (Paperback)

(editor)
£27.99
Paperback 212 Pages / Published: 05/11/1992
  • Not available

This product is currently unavailable.

  • This item has been added to your basket
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.

Publisher: Cambridge University Press
ISBN: 9780521408264
Number of pages: 212
Weight: 320 g
Dimensions: 228 x 152 x 12 mm

You may also be interested in...

Godel's Proof
Added to basket
£11.99
Paperback
Logic DeMYSTiFied
Added to basket
£19.99
Paperback
Godel's Proof
Added to basket
£9.99
Paperback
Sets, Logic and Categories
Added to basket
Introduction to Logic
Added to basket
Numbers and Proofs
Added to basket
£46.99
Paperback
Logic for Dummies
Added to basket
£13.99
Paperback
Modern Logic
Added to basket
£77.99
Paperback
Symbolic Logic and the Game of Logic
Added to basket
The Foundations of Mathematics
Added to basket

Reviews

Please sign in to write a review

Your review has been submitted successfully.