語系:
繁體中文
English
說明(常見問題)
回圖書館
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Feasible computations and provable c...
~
Hartmanis, Juris.
Feasible computations and provable complexity properties
紀錄類型:
書目-電子資源 : 單行本
正題名/作者:
Feasible computations and provable complexity properties/ Juris Hartmanis.
作者:
Hartmanis, Juris.
出版者:
Philadelphia :Society for Industrial and Applied Mathematics, : 1978.,
面頁冊數:
62 p. ;26 cm.;
叢書名:
CBMS-NSF regional conference series in applied mathematics ;
標題:
Computational complexity. -
電子資源:
http://www.igpublish.com/siam-ebook/search.nsp?query0=0-89871-027-8&field0=ISBN
ISBN:
0898710278
Feasible computations and provable complexity properties
Hartmanis, Juris.
Feasible computations and provable complexity properties
[electronic resource] /Juris Hartmanis. - Philadelphia :Society for Industrial and Applied Mathematics,1978. - 62 p. ;26 cm. - CBMS-NSF regional conference series in applied mathematics ;30.
Bibliography: p. 61-62.
ISBN: 0898710278Subjects--Topical Terms:
87584
Computational complexity.
LC Class. No.: QA267 / .H35
Dewey Class. No.: 518.5
Feasible computations and provable complexity properties
LDR
:00604cmm 2200169 i 4500
001
120414
007
crbz ---pcun
008
141127s1978 pau g j eng d
020
$a
0898710278
040
$a
BSF
050
$a
QA267
$b
.H35
082
1 0
$a
518.5
100
1
$a
Hartmanis, Juris.
$3
196892
245
1 0
$a
Feasible computations and provable complexity properties
$h
[electronic resource] /
$c
Juris Hartmanis.
260
$a
Philadelphia :
$c
1978.
$b
Society for Industrial and Applied Mathematics,
300
$a
62 p. ;
$c
26 cm.
440
0
$a
CBMS-NSF regional conference series in applied mathematics ;
$v
30
504
$a
Bibliography: p. 61-62.
650
0
$a
Computational complexity.
$3
87584
650
0
$a
Formal languages.
$3
96416
650
0
$a
Machine theory.
$3
96417
710
2
$a
Conference Board of the Mathematical Sciences.
$3
196886
856
4
$u
http://www.igpublish.com/siam-ebook/search.nsp?query0=0-89871-027-8&field0=ISBN
筆 0 讀者評論
多媒體
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼
登入