|
|
|
|
| LEADER |
00848nam a2200181Ia 4500 |
| 008 |
150624b xxu||||| |||| 00| 0 eng d |
| 020 |
|
|
|a 0471915556
|
| 020 |
|
|
|a 471915556
|
| 082 |
|
|
|a 511.32
|
| 100 |
|
|
|a Wegener, Ingo
|
| 245 |
|
|
|a Complexity of boolean functions /
|c Ingo Wegener
|
| 260 |
|
|
|a New Delhi :
|b John wiley Publications,
|c 1987.
|
| 300 |
|
|
|a 457 p.
|
| 490 |
|
|
|a Wiley-Teubner series in computer science
|
| 505 |
|
|
|a 1. Theory of Boolean functions and circuits 2. Minimization of boolean functions 3. Design of efficient circuits for some fundamental functions 4. Asymptotic resutls and universal circuits 5. Lower bounds on circuits comeplexity 6. Monotone circuits 7. Re
|
| 942 |
|
|
|c BK
|
| 999 |
|
|
|c 46442
|d 46442
|
| 952 |
|
|
|0 0
|1 0
|4 0
|6 511_320000000000000_WEG_C
|7 0
|9 46426
|a UL
|b UL
|c ST2
|d 1998-09-07
|l 0
|o 511.32 WEG/C
|p 68178
|r 2012-11-05
|w 2012-10-27
|y BK
|