Publisher： Cambridge University Press
E-ISSN： 1943-5886|37|1|55-68
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.37, Iss.1, 1972-03, pp. : 55-68
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Splitting theorems for speed-up related to order of enumeration
The Journal of Symbolic Logic, Vol. 47, Iss. 1, 1982-03 ,pp. :
Access to resources
Recommend
Diversity of speed-ups and embeddability in computational complexity
The Journal of Symbolic Logic, Vol. 41, Iss. 1, 1976-03 ,pp. :
On generalized computational complexity
The Journal of Symbolic Logic, Vol. 42, Iss. 1, 1977-03 ,pp. :