| Record ID | marc_loc_updates/v36.i10.records.utf8:1136553:1011 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_updates/v36.i10.records.utf8:1136553:1011?format=raw |
LEADER: 01011cam a22002894a 4500
001 00053829
003 DLC
005 20080307113848.0
008 001102s2001 nyua b 001 0 eng
010 $a 00053829
020 $a0387950559 (alk. paper)
040 $aDLC$cDLC$dDLC
042 $apcc
050 00 $aQA76$b.H6236 2001
082 00 $a004$221
100 1 $aHomer, S.$q(Steven)
245 10 $aComputability and complexity theory /$cSteven Homer, Alan L. Selman.
260 $aNew York :$bSpringer,$cc2001.
300 $axiii, 194 p. :$bill. ;$c24 cm.
440 0 $aTexts in computer science
504 $aIncludes bibliographical references (p. [181]-185) and indexes.
650 0 $aComputer science.
650 0 $aComputable functions.
650 0 $aComputational complexity.
700 1 $aSelman, Alan L.
856 42 $3Publisher description$uhttp://www.loc.gov/catdir/enhancements/fy0816/00053829-d.html
856 41 $3Table of contents only$uhttp://www.loc.gov/catdir/enhancements/fy0816/00053829-t.html