Polynomial time computations in models of ET
- 1 June 1983
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 26 (3) , 311-338
- https://doi.org/10.1016/0022-0000(83)90004-1
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Unprovability of theorems of complexity theory in weak number theoriesTheoretical Computer Science, 1982
- On the structure of sets in NP and other complexity classesTheoretical Computer Science, 1981
- Independence results in computer science?Journal of Computer and System Sciences, 1981
- Indexings of subrecursive classesTheoretical Computer Science, 1980
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975