| Record ID | ia:branchandboundal438naka |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/branchandboundal438naka/branchandboundal438naka_marc.xml |
| Download MARC binary | https://www.archive.org/download/branchandboundal438naka/branchandboundal438naka_meta.mrc |
LEADER: 00950cam 2200241 4500
001 826764
005 20020415161746.0
008 720321s1971 ilua b 00010 engm
035 $a(OCoLC)ocm00282135
035 $9ADJ-9751
040 $aDLC$cDLC$dm.c.$dUIU
050 0 $aQA76$b.I4 no. 438$aQA401
082 $a001.6/4/08 s$a519.7
100 10 $aNakagawa, Tomoyasu.
245 12 $aA branch-and-bound algorithm for optimal NOR networks (the algorithm description)$cby Tomoyasu Nakagawa [and] Hung-Chi Lai.
260 0 $aUrbana,$bDept. of Computer Science, University of Illinois$c[1971]
300 $a29 p.$billus.$c28 cm.
440 0 $aReport (University of Illinois at Urbana-Champaign. Dept. of Computer Science)$vno. 438
504 $aBibliography: p. 29.
650 0 $aSwitching theory
650 0 $aBranch and bound algorithms
700 10 $aLai, Hung-Chi.
830 0 $aReport (University of Illinois at Urbana-Champaign. Dept. of Computer Science)$vno. 438