LEADER 01414nam0 2200313 i 450 
001 VAN00076630
005 20240806100610.521
010   $a978-05-214-0826-4
100   $a20100917d1992       |0itac50      ba
101   $aeng
102   $aGB
105   $a||||    |||||
200 1 $aBoolean function complexity$fedited by M. S. Paterson
210   $aCambridge$cCambridge university$d1992
215   $a201 p.$d23 cm
410  1$1001VAN00029528$12001 $aLondon Mathematical Society lecture notes series$1210  $aCambridge$cCambridge university$v169
606   $a00B25$xProceedings of conferences of miscellaneous specific interest [MSC 2020]$3VANC020732$2MF
606   $a06E30$xBoolean functions [MSC 2020]$3VANC027709$2MF
606   $a68-XX$xComputer science [MSC 2020]$3VANC019670$2MF
606   $a94-XX$xInformation and communication theory, circuits [MSC 2020]$3VANC019701$2MF
620   $dCambridge$3VANL000024
702  1$aPaterson$bMichael S.$3VANV042639
712   $aCambridge university <editore>$3VANV107986$4650
801   $aIT$bSOL$c20240906$gRICA
899   $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$1IT-CE0120$2VAN08
912   $aVAN00076630
950   $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08PREST     68-XX                   3171        $e08   2006      I       20100917            
996   $aBoolean function complexity$9376422
997   $aUNICAMPANIA