Publisher： Cambridge University Press
E-ISSN： 1943-5886|73|2|656-673
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.73, Iss.2, 2008-06, pp. : 656-673
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
Undecidable complexity statements in
The Journal of Symbolic Logic, Vol. 54, Iss. 2, 1989-06 ,pp. :
Access to resources
Recommend
The Complexity of Problems for Quantified Constraints
Theory of Computing Systems, Vol. 47, Iss. 2, 2010-08 ,pp. :
Recognition problems and communication complexity
By Wiener G.
Discrete Applied Mathematics, Vol. 137, Iss. 1, 2004-02 ,pp. :