Author： Bauland Michael
Publisher： Springer Publishing Company
ISSN： 1432-4350
Source： Theory of Computing Systems, Vol.47, Iss.2, 2010-08, pp. : 454-490
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
Recognition problems and communication complexity
By Wiener G.
Discrete Applied Mathematics, Vol. 137, Iss. 1, 2004-02 ,pp. :
Access to resources
Recommend
Generic complexity of undecidable problems
The Journal of Symbolic Logic, Vol. 73, Iss. 2, 2008-06 ,pp. :
Classifying the computational complexity of problems
The Journal of Symbolic Logic, Vol. 52, Iss. 1, 1987-03 ,pp. :
MASS PROBLEMS AND INITIAL SEGMENT COMPLEXITY
The Journal of Symbolic Logic, Vol. 79, Iss. 1, 2014-04 ,pp. :
The Complexity of Classification Problems for Models of Arithmetic
Bulletin of Symbolic Logic, Vol. 16, Iss. 3, 2010-09 ,pp. :