Publisher： Cambridge University Press
E-ISSN： 1943-5886|42|1|47-58
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.42, Iss.1, 1977-03, pp. : 47-58
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
Computational complexity, speedable and levelable sets
The Journal of Symbolic Logic, Vol. 42, Iss. 4, 1977-12 ,pp. :
The Computational Complexity of Weak Saddles
By Brandt Felix
Theory of Computing Systems, Vol. 49, Iss. 1, 2011-07 ,pp. :
Classifying the computational complexity of problems
The Journal of Symbolic Logic, Vol. 52, Iss. 1, 1987-03 ,pp. :