Computational complexity, speedable and levelable sets1

Publisher: Cambridge University Press

E-ISSN: 1943-5886|42|4|545-563

ISSN: 0022-4812

Source: The Journal of Symbolic Logic, Vol.42, Iss.4, 1977-12, pp. : 545-563

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract