Feasible computations and provable complexity properties

Author(s)

• Hartmanis, Juris

Bibliographic Information

Feasible computations and provable complexity properties

Juris Hartmanis

（CBMS-NSF regional conference series in applied mathematics, 30）

Society for Industrial and Applied Mathematics, 1978

Note

Bibliography: p. 61-62

• NCID: BA01274402
• LCCN: 78014744
• Country Code: us
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: Philadelphia
• Pages/Volumes: 62 p.
• Size: 26 cm
• Classification:
  • LCC : QA267
  • DC : 519.4
• Subject Headings:
  • LCSH : Machine theory
  • LCSH : Formal languages
  • LCSH : Computational complexity
• Parent Bibliography ID:
  • BA00021150