Publisher： Cambridge University Press
E-ISSN： 1943-5886|43|4|667-672
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.43, Iss.4, 1978-12, pp. : 667-672
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
Two recursion theoretic characterizations of proof speed-ups
The Journal of Symbolic Logic, Vol. 54, Iss. 2, 1989-06 ,pp. :
On size vs. efficiency for programs admitting speed-ups
The Journal of Symbolic Logic, Vol. 36, Iss. 1, 1971-03 ,pp. :
Independent Gödel sentences and independent sets
The Journal of Symbolic Logic, Vol. 40, Iss. 2, 1975-06 ,pp. :
The Journal of Symbolic Logic, Vol. 46, Iss. 3, 1981-09 ,pp. :