1 option
Feasible computations and provable complexity properties / Juris Hartmanis.
Math/Physics/Astronomy Library QA267 .H35
Available
- Format:
- Book
- Author/Creator:
- Hartmanis, Juris.
- Series:
- Regional conference series in applied mathematics ; 30.
- Regional conference series in applied mathematics ; 30
- Language:
- English
- Subjects (All):
- Machine theory.
- Formal languages.
- Computational complexity.
- Physical Description:
- 62 pages ; 26 cm.
- Place of Publication:
- Philadelphia : Society for Industrial and Applied Mathematics, [1978]
- Notes:
- Bibliography: page.
- OCLC:
- 4135502
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.