| Record ID | ia:computationallim00hsta |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/computationallim00hsta/computationallim00hsta_marc.xml |
| Download MARC binary | https://www.archive.org/download/computationallim00hsta/computationallim00hsta_meta.mrc |
LEADER: 01977cam 2200517 a 4500
001 ocm15198225
003 OCoLC
005 20181011165246.0
008 861216s1987 mau b 001 0 eng
010 $a 86033802
040 $aDLC$beng$cDLC$dUKM$dMUQ$dNLGGC$dYDXCP$dBDX$dOCLCO$dOCLCF$dOCLCQ
015 $aGB8746795$2bnb
019 $a16873011
020 $a0262081679
020 $a9780262081672
035 $a(OCoLC)15198225$z(OCoLC)16873011
050 00 $aTK7868.L6$bH37 1987
082 00 $a621.3815/3$219
084 $a54.10$2bcl
100 1 $aHa stad, Johan.
245 10 $aComputational limitations for small-depth circuits /$cJohan Ha stad.
260 $aCambridge, Mass. :$bMIT Press,$c℗♭1987.
300 $a82 pages ;$c24 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
338 $avolume$bnc$2rdacarrier
490 1 $aACM doctoral dissertation awards ;$v1986
500 $aOriginally presented as the author's thesis (Ph. D.)--Massachusetts Institute of Technology, 1986.
504 $aIncludes bibliographical references (pages 79-82) and index.
650 0 $aLogic circuits.
650 0 $aComputational complexity.
650 6 $aCircuits logiques.
650 6 $aComplexite de calcul (Informatique)
650 7 $aComputational complexity.$2fast$0(OCoLC)fst00871991
650 7 $aLogic circuits.$2fast$0(OCoLC)fst01002031
650 17 $aFundamentele informatica.$2gtt
653 $aLogic circuits$aComputational complexity
776 08 $iOnline version:$aHa stad, Johan.$tComputational limitations for small-depth circuits.$dCambridge, Mass. : MIT Press, ℗♭1987$w(OCoLC)647361293
830 0 $aACM doctoral dissertation award ;$v1986.
938 $aBrodart$bBROD$n37946056$c$20.00
938 $aYBP Library Services$bYANK$n147034
029 1 $aAU@$b000005123904
029 1 $aNLGGC$b044145357
029 1 $aYDXCP$b147034
994 $aZ0$bP4A
948 $hNO HOLDINGS IN P4A - 148 OTHER HOLDINGS