| Record ID | marc_miami_univ_ohio/allbibs0061.out:4912308:1038 |
| Source | Miami University of Ohio |
| Download Link | /show-records/marc_miami_univ_ohio/allbibs0061.out:4912308:1038?format=raw |
LEADER: 01038cam 2200277Ia 4500
001 ocm27082984
005 19930122152632.0
008 921208s1992 enka b 100 0 eng d
010 $agb 92050629
020 $a0521408261
040 $aOUN$cOUN$dUKM$dFPU$dMIA
049 $aMIAS
090 $aQA10.3$b.B66 1992
111 2 $aLMS Durham Symposium$d(1990)
245 10 $aBoolean function complexity /$cedited by M.S. Paterson
260 $aCambridge ;$aNew York :$bCambridge University Press,$cc1992
300 $a201 p. :$bill. ;$c23 cm
490 1 $aLondon Mathematical Society lecture note series ;$v169
504 $aIncludes bibliographical references
650 0 $aAlgebra, Boolean$xCongresses
650 0 $aComputational complexity$xCongresses
700 10 $aPaterson, Michael S
830 0 $aLondon Mathematical Society lecture note series ;$v169
907 $a.b17641858$b11-24-94$c11-23-92
998 $ascl$b11-24-94$cm$da$e-$feng$genk$h0$i1
945 $g1$i35054012295156$j0$lscli $o-$p$0.00$s-$t0$u1$v0$w0$x0$y.i20095429$z01-22-93