Final Report on NSF Research Grant Automata and Computational Complexity 1968-1972

Juris Hartmanis · eCommons (Cornell University) · 1972

This report summarizes the results obtained in research supported by the National Science Foundation Grant AUTOMATA AND COMPUTATIONAL COMPLEXITY. The report lists the problem areas considered, the publications resulting from this work and gives an outline of the more recent research results which have not yet been published.

Read the paper · More papers on PaperTik