LEADER 01268nam a2200313 i 4500
001 991000720779707536
005 20020507172725.0
008 001106s1992    uk            ||| | eng  
020   $a0521408261
035   $ab10747965-39ule_inst
035   $aLE01301261$9ExL
040   $aDip.to Matematica$beng
082 0 $a519.4
084   $aAMS 68-06
100 1 $aPaterson, Michael S.$0534793
245 10$aBoolean function complexity /$cedited by M. S. Paterson
260   $aCambridge :$bCambridge University Press,$c1992
300   $a201 p. :$bill. ;$c23 cm
490 0 $aLondon Mathematical Society lecture note series,$x0076-0552 ;$v169
500   $aPapers from the Symposium on Boolean Function Complexity, held July, 1990, at Durham University and sponsored by the London Mathematical Society.
500   $aIncludes bibliographical references
650  0$aBoolean algebra
650  0$aComputational complexity$xCongresses
907   $a.b10747965$b23-02-17$c28-06-02
912   $a991000720779707536
945   $aLE013 68-XX PAT11 (1992)$g1$i2013000122939$lle013$o-$pE0.00$q-$rl$s-  $t0$u1$v0$w1$x0$y.i10840400$z28-06-02
996   $aBoolean function complexity$9911605
997   $aUNISALENTO
998   $ale013$b01-01-00$cm$da  $e-$feng$guk $h0$i1