"On the Problem of Finding Natural Computational Complexity Measures."

Juris Hartmanis (1973)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2011-02-04

- no documents available
- export record
  dblp key:
  - conf/mfcs/Hartmanis73
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/Hartmanis73
Juris Hartmanis:
On the Problem of Finding Natural Computational Complexity Measures. MFCS 1973: 95-103

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.