Feasible computations and provable complexity properties /

Spremljeno u:
Bibliografski detalji
Glavni autor: Hartmanis, Juris
Format: Knjiga
Jezik:English
Izdano: Philadelphia : Society for Industrial and Applied Mathematics, 1978.
Serija:CBMS-NSF regional conference series in applied mathematics ; 30
Teme:
LEADER 01037nam a2200277 i 4500
001 c000132162
003 CARM
005 00000000000000.0
008 780707s1978 pau b 00010 eng
019 1 |a 1228161  |5 LACONCORD2021 
020 |c $7.75 
035 |a (OCoLC)4135502  |5 LACONCORD2021 
050 0 0 |a QA267  |b .H35 
100 1 |a Hartmanis, Juris. 
245 1 0 |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 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 Machine theory. 
650 0 |a Formal languages. 
650 0 |a Computational complexity. 
852 8 |b CARM  |h A2:AD06E0  |i C00447  |p 0025477  |f BK 
082 0 4 |a 519.4 
999 f f |i 97ad8ffa-6409-5e26-b56c-2e97ef237801  |s 361e1fcf-0b68-573c-ac08-a6c71f37d4ce 
952 f f |p Can circulate  |a CAVAL  |b CAVAL  |c CAVAL  |d CARM 1 Store  |e C00447  |f A2:AD06E0  |h Other scheme  |i book  |m 0025477