Hartmanis, Juris <br/><br/>
Feasible computations and provable complexity properties 
Juris Hartmanis 
 - Philadelphia, PA  Society for Industrial and Applied Mathematics  1989 
 - 62 p. ; 26 cm 
<br/><br/> Bibliography: p. 61-62 
<br/><br/><label>ISSN: </label>78014744 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computational complexity<br/>Formal languages<br/>Machine theory
<br/><br/><label>Dewey Class. No.: </label>519.4 HAR