Książka Boolean Function Complexity M. S. Paterson

Boolean Function Complexity

Język: Angielski
Oprawa: Miękka
Dostępność: Dostępna u dostawcy
Wysyłamy za 9-15 dni
222.25
By considering the size of the logical network needed to perform a given computational task, the int...

Informacje o książce

Język
Angielski
Oprawa
Książka - Miękka
Data wydania
1992
strony
212
EAN
9780521408264
ISBN
0521408261
Enbook ID
02029882
Waga
315
Wymiary
152 x 229 x 12

Pełny opis

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.

Możesz być zainteresowany

275.32

Text-Based Writing, Grade 6 Teacher Resource

Evan-Moor Educational Publishers
77.00

Journey to Russia

Dragana Obradovic
66.78

ECSCW 2001

Wolfgang Prinz
470.91

Yeast Biotechnology

David R. Berry
845.73

The Quartet

John R. Sweney
102.99

Mystical Theology

Dionysius the Areopagite
159.27

Klienci, którzy kupili tę książkę, kupili również

76.42

Sport-Hypnose

R. F.-J. K. Eck
91.90

REIKI

Brigitte Grimberg
81.38