The Leading eBooks Store Online
for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, Sony Reader ...
Boolean Function Complexity
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.
The Extreme Searcher's Internet Handbook 2013 US$ 19.99 345 pages
The New Digital Age 2013 US$ 11.99 336 pages
Steve Jobs 2011 US$ 14.57 448 pages
Successful Business Intelligence: Unlock the Value of BI & Big Data, Second Edition 2013 US$ 40.00 337 pages