Carte Boolean Function Complexity M. S. Paterson

Boolean Function Complexity

Limbă: engleză
Legare: Carte broșată
Disponibilitate: În depozitul extern
Expediem în 9-15 zile
287.04 lei
By considering the size of the logical network needed to perform a given computational task, the int...

Informații despre carte

Limbă
engleză
Legare
Carte - Carte broșată
Publicat
1992
Pagini
212
EAN
9780521408264
ISBN
0521408261
Enbook ID
02029882
Greutate
315
Dimensiuni
152 x 229 x 12

Descriere completă

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.

S-ar putea să te intereseze

355.66 lei

Text-Based Writing, Grade 6 Teacher Resource

Evan-Moor Educational Publishers
100.95 lei

Journey to Russia

Dragana Obradovic
82.41 lei

ECSCW 2001

Wolfgang Prinz
581.45 lei

Yeast Biotechnology

David R. Berry
1 100.75 lei

The Quartet

John R. Sweney
134.50 lei

Mystical Theology

Dionysius the Areopagite
196.57 lei

Clienții care au cumpărat această carte au mai cumpărat și

100.24 lei

Sport-Hypnose

R. F.-J. K. Eck
120.19 lei

REIKI

Brigitte Grimberg
106.39 lei