語系:
繁體中文
English
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Feasible computations and provable c...
~
Conference Board of the Mathematical Sciences.
Feasible computations and provable complexity properties /
紀錄類型:
書目-語言資料,印刷品 : Monograph/item
正題名/作者:
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 /
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:
527777
Computational complexity.
LC Class. No.: QA267 / .H35
Dewey Class. No.: 518.5
Feasible computations and provable complexity properties /
LDR
:00537cam a2200145 i 4500
001
558569
008
090326s1978 paum b a000 0 eng
020
$a
0898710278
050
$a
QA267
$b
.H35
082
1 0
$a
518.5
100
$a
Hartmanis, Juris.
$3
527774
245
1 0
$a
Feasible computations and provable complexity properties /
$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
$a
Computational complexity.
$3
527777
650
$a
Formal languages.
$3
527776
650
$a
Machine theory.
$3
527775
710
$a
Conference Board of the Mathematical Sciences.
$3
527769
856
4
$u
http://www.igpublish.com/siam-ebook/search.nsp?query0=0-89871-027-8&field0=ISBN
筆 0 讀者評論
多媒體
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼[密碼必須為2種組合(英文和數字)及長度為10碼以上]
登入