Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Juris Hartmanis. Feasible computations and provable complexity properties. Volume 30 of CBMS-NSF regional conference series in applied mathematics, SIAM, 1989.
Possibly Related PublicationsThe following publications are possibly variants of this publication: Generalized Kolmogorov Complexity and the Structure of Feasible Computations (Preliminary Report)Juris Hartmanis. focs 1983: 439-445
The following publications are possibly variants of this publication: