Location & Availability for: Feasible computations and provable compl

 Staff view

You must be logged in to Tag Records

Feasible computations and provable complexity properties [electronic resource] /

Juris Hartmanis.

Book Cover
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


Spaces will separate tags.
Use quotes for multi-word tags.


Loading Holdings Data ... Loading

Location & Availability for: Feasible computations and provable compl