Author： Weber Volker
Publisher： Springer Publishing Company
ISSN： 1432-4350
Source： Theory of Computing Systems, Vol.40, Iss.4, 2007-06, pp. : 355-377
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
Strong isomorphism reductions in complexity theory
The Journal of Symbolic Logic, Vol. 76, Iss. 4, 2011-12 ,pp. :
Access to resources
Recommend
Provable conditions in computational complexity theory
Bulletin of the Australian Mathematical Society, Vol. 31, Iss. 1, 1985-02 ,pp. :
Von Neumann, Gödel and Complexity Theory
Bulletin of Symbolic Logic, Vol. 16, Iss. 4, 2010-12 ,pp. :