LEADER 01332nam0 2200301 i 450 
001 SUN0076630
005 20151120101600.498
010   $a978-05-214-0826-4
100   $a20100917d1992       |0engc50      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$1001SUN0029528$12001 $a*London Mathematical Society lecture notes series$v169$1210  $aCambridge$cCambridge university.
606   $a68-XX$xComputer science [MSC 2020]$2MF$3SUNC019670
606   $a94-XX$xInformation and communication theory, circuits [MSC 2020]$2MF$3SUNC019701
606   $a00B25$xProceedings of conferences of miscellaneous specific interest [MSC 2020]$2MF$3SUNC020732
606   $a06E30$xBoolean functions [MSC 2020]$2MF$3SUNC027709
620   $dCambridge$3SUNL000024
702  1$aPaterson$b, Michael S.$3SUNV042639
712   $aCambridge university$3SUNV000097$4650
801   $aIT$bSOL$c20201012$gRICA
912   $aSUN0076630
950   $aUFFICIO DI BIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08PREST     68-XX                   3171        $e08   2006      I       20100917            
996   $aBoolean function complexity$9376422
997   $aUNICAMPANIA