Minimal pairs of polynomial degrees with subexponential complexity
- 30 June 1976
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 2 (1), 73-76
- https://doi.org/10.1016/0304-3975(76)90007-4
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975
- The honest subrecursive classes are a latticeInformation and Control, 1974
- Polynomial and abstract subrecursive classesPublished by Association for Computing Machinery (ACM) ,1974
- Type two computational complexityPublished by Association for Computing Machinery (ACM) ,1973
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965