Feasible computations and provable complexity properties /

Main Author: Hartmanis, Juris
Format: Book
Published: Philadelphia: Society for Industrial and Applied Mathematics, 1978
Series:CBMS-NSF regional conference series in applied mathematics ; 30
Subjects:
LEADER 00737nam a2200205 a 4500
001 593909
005 20171111230050.0
008 060708s1978----gr er 000 0 Eng d
040 |a GR-AtNTU  |b gre 
082 0 |a 519.4 HAR 
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. 
490 0 |a CBMS-NSF regional conference series in applied mathematics ;  |v 30 
504 |a Includes references. 
650 1 0 |a Machine theory 
650 1 0 |a Formal languages 
650 1 0 |a Computational complexity 
952 |a GR-AtNTU  |b 59cc15546c5ad13446f69716  |c 998a  |d 945l  |e 519.4 HAR  |t 1  |x m  |z Books