Kniha Boolean Function Complexity M. S. Paterson

Boolean Function Complexity

Jazyk: Angličtina
Vazba: Brožovaná
Dostupnost: Skladem u dodavatele
Odesíláme za 9-15 dnů
1 210
By considering the size of the logical network needed to perform a given computational task, the int...

Informace o knize

Jazyk
Angličtina
Vazba
Kniha - Brožovaná
Vydáno
1992
Stránek
212
EAN
9780521408264
ISBN
0521408261
Enbook ID
02029882
Hmotnost
315
Rozměry
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 zajímat

1 499

Text-Based Writing, Grade 6 Teacher Resource

Evan-Moor Educational Publishers
420

Journey to Russia

Dragana Obradovic
358

ECSCW 2001

Wolfgang Prinz
2 567

Yeast Biotechnology

David R. Berry
5 079

The Quartet

John R. Sweney
678

Mystical Theology

Dionysius the Areopagite
868

Zákaznicí kteří koupili tuto knihu koupili také

409

Sport-Hypnose

R. F.-J. K. Eck
722

REIKI

Brigitte Grimberg
534