Feasible computations and provable complexity properties

Juris Hartmanis. Feasible computations and provable complexity properties. Volume 30 of CBMS-NSF regional conference series in applied mathematics, SIAM, 1989.

Authors

Juris Hartmanis

This author has not been identified. Look up 'Juris Hartmanis' in Google