Feasible computations and provable complexity properties
By: Juris Hartmanis.
Series: CBMS-NSF regional conference series in applied mathematics ;; 30
Publisher: Society for Industrial and Applied Mathematics
Published: 1978
Place of publication: Philadelphia
Language: eng
Number of pages: 62
Subjects: Machine theory.; Formal languages.; Computational complexity.
Notes: Bibliography: p. 61-62.