Tools

LEADER 01302cam 2200361 i 4500

001 ocm04135502;

005 20141212012839.0;

008 780707s1978 pau b 000 0 eng ;

010 a| 78014744;

020 c| $7.75;

035 a| (Sirsi) o04135502;

035 a| (OCoLC)04135502;

040 a| DLCc| DLCd| EREd| UtOrBLW;

049 a| ERE*;

050 00 a| QA267b| .H35;

082 0 a| 519.4;

100 1 a| Hartmanis, Juris.=| ^A299875;

245 10 a| Feasible computations and provable complexity properties /c| Juris Hartmanis.;

260 a| Philadelphia :b| Society for Industrial and Applied Mathematics,c| 1978.;

300 a| 62 pages ;c| 26 cm.;

336 a| text2| rdacontent;

337 a| unmediated2| rdamedia;

338 a| volume2| rdacarrier;

490 1 a| CBMS-NSF Regional conference series in applied mathematics ;v| 30;

504 a| Bibliography: p. 61-62.;

650 0 a| Machine theory.=| ^A16040;

650 0 a| Formal languages.=| ^A16039;

650 0 a| Computational complexity.=| ^A74807;

830 0 a| CBMS-NSF regional conference series in applied mathematicsv| 30.=| ^A108923;

919 a| BOOK;

596 a| 1;

998 a| 147813;

999 a| QA267 .H35w| LCc| 1i| 310372001702807d| 4/18/2017e| 10/20/2016l| JGESm| JOYNERn| 6r| Ys| Yt| JGESBKu| 5/26/1986x| BOOKz| JSTACKSo| .STAFF. 0o| .STAFF. Copy Statement : c.1;

Feasible computations and provable complexity properties / Juris Hartmanis.

Author/creator	Hartmanis, Juris
Format	Book
Publication Info	Philadelphia : Society for Industrial and Applied Mathematics, 1978.
Description	62 pages ; 26 cm.
Subjects	Machine theory. Formal languages. Computational complexity.

Series	CBMS-NSF Regional conference series in applied mathematics ; 30 CBMS-NSF regional conference series in applied mathematics 30. ^A108923
Bibliography note	Bibliography: p. 61-62.
LCCN	78014744

Availability

Library	Location	Call Number	Status	Item Actions
Joyner	General Stacks	QA267 .H35	✔ Available	Place Hold

Feasible computations and provable complexity properties / Juris Hartmanis.

Click here for more information about this title

Availability