Free delivery for orders over 69.99 euro.

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 69.99 €

DPD courier 5.99 € Bpost point 7.99 € Bpost 7.49 € DPD point 3.49 € GLS courier 4.49 €

Contact

How to shop

Help

My account

▸ Empty :-(

Free delivery for orders over 69.99 euro.

Boolean Function Complexity

Name: Boolean Function Complexity
Brand: Cambridge University Press
SKU: 02029882
Price: 54.07 EUR
Availability: InStock
Author: M. S. Paterson
ISBN: 9780521408264

M. S. Paterson

Language

English

Book Paperback

Libristo code: 02029882

Publishers Cambridge University Press, November 1992

By considering the size of the logical network needed to perform a given computational task, the int... Full description

Libristo code: 02029882

131 b

54.07 €

In stock at our supplier Shipping in 9-15 days

30-day return policy

Customers also purchased

Sprache der Symbole, Spache der Natur Omraam M. Aivanhov

Hardback

18.63 €

JOAN TRIADU, L'IMPULS OBSTINAT PONS

Hardback

21.36 €

Vom Jiu-Jitsu zur effektiven Deeskalation Dennis Müssener

Paperback

12.65 €

Ihr habt Euren Glauben, ich indes habe meinem... M Razavi Rad

Paperback

20.85 €

Objektive Berichterstattung oder erkaufte Prasenz Florian Riedel

Paperback

35.74 €

Sport-Hypnose R. F.-J. K. Eck

Paperback

22.37 €

REIKI Brigitte Grimberg

Hardback

19.84 €

Aggressionspraevention bei Madchen und Jungen Livia Hafner

Paperback

42.83 €

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.