Publisher： Cambridge University Press
E-ISSN： 1943-5886|52|1|1-43
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.52, Iss.1, 1987-03, pp. : 1-43
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
The Computational Complexity of Weak Saddles
By Brandt Felix
Theory of Computing Systems, Vol. 49, Iss. 1, 2011-07 ,pp. :
Access to resources
Recommend
On generalized computational complexity
The Journal of Symbolic Logic, Vol. 42, Iss. 1, 1977-03 ,pp. :
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. :
Generic complexity of undecidable problems
The Journal of Symbolic Logic, Vol. 73, Iss. 2, 2008-06 ,pp. :