| Record ID | marc_records_scriblio_net/part12.dat:39324502:921 |
| Source | Scriblio |
| Download Link | /show-records/marc_records_scriblio_net/part12.dat:39324502:921?format=raw |
LEADER: 00921nam 2200229 4500
001 79637326
003 DLC
005 19720403000000.0
008 720321s1971 ilua b 00010 eng
010 $a 79637326
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.
490 1 $aUniversity of Illinois at Urbana-Champaign. Dept. of Computer Science. Report no. 438
504 $aBibliography: p. 29.
650 0 $aSwitching theory.
650 0 $aBranch and bound algorithms.
700 10 $aLai, Hung-Chi,$ejoint author.
810 1 $aIllinois.$bUniversity at Urbana-Champaign.$bDept. of Computer Science.$tReport$vno. 438.