Kniha Boolean Function Complexity M. S. Paterson

Boolean Function Complexity

Jazyk: Angličtina
Väzba: Brožovaná
Dostupnosť: Skladom u dodávateľa
Odosielame za 9-15 dní
49.84
By considering the size of the logical network needed to perform a given computational task, the int...

Informácie o knihe

Jazyk
Angličtina
Väzba
Kniha - Brožovaná
Vydalo
1992
Stránok
212
EAN
9780521408264
ISBN
0521408261
Enbook ID
02029882
Hmotnosť
315
Rozmery
152 x 229 x 12

Kompletný popis

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.

Mohlo by vás zaujímať

61.79

Text-Based Writing, Grade 6 Teacher Resource

Evan-Moor Educational Publishers
17.03

Journey to Russia

Dragana Obradovic
14.78

ECSCW 2001

Wolfgang Prinz
105.86

Yeast Biotechnology

David R. Berry
199.20

The Quartet

John R. Sweney
24.28

Mystical Theology

Dionysius the Areopagite
35.84

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež

18.01

Sport-Hypnose

R. F.-J. K. Eck
21.63

REIKI

Brigitte Grimberg
19.19