Author： Schmidt-Schauß Manfred
Publisher： Springer Publishing Company
ISSN： 1432-4350
Source： Theory of Computing Systems, Vol.37, Iss.6, 2004-12, pp. : 717-740
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
On the linear complexity of binary lattices
By Gyarmati Katalin Mauduit Christian Sárközy András
The Ramanujan Journal, Vol. 32, Iss. 2, 2013-11 ,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. :
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. :