Feasible computations and provable complexity properties
Feasible computations and provable complexity properties
Juris Hartmanis
Details
OL Work ID
OL6802445W
Subjects
Computational complexity
Formal languages
Machine theory
Find this book
Open Library