Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

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 19 990 Ft

DPD point 990 Ft DPD courier 1 190 Ft GLS point 1 190 Ft Hungarian Post 1 795 Ft Hungarian Post 1 690 Ft Hungarian Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft GLS courier 1 690 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Boolean Function Complexity

Name: Boolean Function Complexity
Brand: Cambridge University Press
SKU: 02029882
Price: 21022 HUF
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

140 b

21 022 Ft

In stock at our supplier Shipping in 14-21 days

Up to 30 days for returns

Customers also purchased

Sprache der Symbole, Spache der Natur Omraam M. Aivanhov

Hardback

7 408 Ft

JOAN TRIADU, L'IMPULS OBSTINAT PONS

Hardback

7 706 Ft

Vom Jiu-Jitsu zur effektiven Deeskalation Dennis Müssener

Paperback

5 025 Ft

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

Paperback

7 451 Ft

Objektive Berichterstattung oder erkaufte Prasenz Florian Riedel

Paperback

14 156 Ft

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

Paperback

8 857 Ft

REIKI Brigitte Grimberg

Hardback

7 824 Ft

Aggressionspraevention bei Madchen und Jungen Livia Hafner

Paperback

16 954 Ft

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.