| Record ID | ia:studyofconcretec716yaoa |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/studyofconcretec716yaoa/studyofconcretec716yaoa_marc.xml |
| Download MARC binary | https://www.archive.org/download/studyofconcretec716yaoa/studyofconcretec716yaoa_meta.mrc |
LEADER: 01100cam 2200265 i 4500
001 832605
005 20130306092042.0
008 751118s1975 ilu b s00010 eng
035 $a(OCoLC)ocm01426127
035 $9ADK-6048
040 $aDLC$cDLC$dm.c.$dUIU
050 0 $aQA76$b.I4 no. 716$aQA76.5
082 $a001.6/4/08 s$a001.6/42
100 10 $aYao, Andrew Chi-Chih.
245 12 $aA study of concrete computational complexity /$cby Andrew Chi-Chih Yao.
260 0 $aUrbana, Illinois :$bDept. of Computer Science, University of Illinois at Urbana-Champaign,$c1975.
300 $avi, 89 p. ;$c28 cm.
440 0 $aReport (University of Illinois at Urbana-Champaign. Dept. of Computer Science)$vno. 716
500 $a"UIUCDCS-R-75-716"
502 $aThesis--University of Illinois at Urbana-Champaign.
504 $aBibliography: p. 69-70.
650 0 $aComputer programming.
650 0 $aComputational complexity.
710 2 $aUniversity of Illinois at Urbana-Champaign.$bDept. of Computer Science.
830 0 $aReport (University of Illinois at Urbana-Champaign. Dept. of Computer Science)$vno. 716.