Author： Wiener G.
Publisher： Elsevier
ISSN： 0166-218X
Source： Discrete Applied Mathematics, Vol.137, Iss.1, 2004-02, pp. : 109-123
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
The Complexity of Problems for Quantified Constraints
Theory of Computing Systems, Vol. 47, Iss. 2, 2010-08 ,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. :