close
You must be logged in for this
close
Add to Favorites
Staff view
close
Cite This Record
APA Citation
Hartmanis, Juris. (1978) Feasible computations and provable complexity propertiesPhiladelphia, Pa. : Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104),
MLA CitationThese citations may not conform precisely to your selected citation style. Please use this display as a guideline and modify as needed.
close
Email This Record
You must be logged in to Tag Records
Feasible computations and provable complexity properties [electronic resource] /
Juris Hartmanis.
| Main Author: | Hartmanis, Juris. |
|---|---|
| Published: | Philadelphia, Pa. : Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104), 1978. |
| Series: |
CBMS-NSF regional conference series in applied mathematics ; 30. |
| Topics: | Machine theory. | Formal languages. | Computational complexity. |
| Tags: | Add |
Loading Holdings Data ... 
