LEADER 00876nam0-22003011i-450-
001 990001329560403321
005 20100215150507.0
010   $a0-521-40826-1
035   $a000132956
035   $aFED01000132956
035   $a(Aleph)000132956FED01
035   $a000132956
100   $a20001205d1992----km-y0itay50------ba
101 0 $aeng
200 1 $aBoolean function complexity$fEdited by M. S. Paterson.
210   $aCambridge (NY)$cCambridge University Press$dc1992
215   $aix, 201 p.$d24 cm
225 1 $aLondon Mathematical Society lecture note series$v169
610 0 $aComputer science$aCongressi
676   $a005.131
702  1$aPaterson,$bM.S.
801  0$aIT$bUNINA$gRICA$2UNIMARC
901   $aBK
912   $a990001329560403321
952   $aC-9-(169$b10194$fMA1
959   $aMA1
996   $aBoolean function complexity$9376422
997   $aUNINA