Könyv Boolean Function Complexity M. S. Paterson

Boolean Function Complexity

Szerző: M. S. Paterson
Nyelv: Angol
Kötés: Puha kötésű
Elérhetőség: Beszállítói készleten
Küldés 9-15 napon belül
19 973 Ft
By considering the size of the logical network needed to perform a given computational task, the int...

Információk a könyvről

Szerző
Nyelv
Angol
Kötés
Könyv - Puha kötésű
Kiadva
1992
oldal
212
EAN
9780521408264
ISBN
0521408261
Enbook ID
02029882
Súly
315
Méretek
152 x 229 x 12

Teljes leírás

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.

Érdekelheti

24 738 Ft

Text-Based Writing, Grade 6 Teacher Resource

Evan-Moor Educational Publishers
7 079 Ft

Journey to Russia

Dragana Obradovic
5 788 Ft

ECSCW 2001

Wolfgang Prinz
40 448 Ft

Yeast Biotechnology

David R. Berry
76 883 Ft

The Quartet

John R. Sweney
9 410 Ft

Mystical Theology

Dionysius the Areopagite
13 678 Ft

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

7 039 Ft

Sport-Hypnose

R. F.-J. K. Eck
8 415 Ft

REIKI

Brigitte Grimberg
7 433 Ft