Publisher： Cambridge University Press
E-ISSN： 1943-5886|54|2|522-526
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.54, Iss.2, 1989-06, pp. : 522-526
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
Diversity of speed-ups and embeddability in computational complexity
The Journal of Symbolic Logic, Vol. 41, Iss. 1, 1976-03 ,pp. :
Access to resources
Recommend
On size vs. efficiency for programs admitting speed-ups
The Journal of Symbolic Logic, Vol. 36, Iss. 1, 1971-03 ,pp. :
Some results on measure independent Gödel speed-ups
The Journal of Symbolic Logic, Vol. 43, Iss. 4, 1978-12 ,pp. :
Minimal
The Journal of Symbolic Logic, Vol. 38, Iss. 1, 1973-03 ,pp. :
A recursion theoretic analysis of the clopen Ramsey theorem
The Journal of Symbolic Logic, Vol. 49, Iss. 2, 1984-06 ,pp. :