Author： Arias Marta
Publisher： Springer Publishing Company
ISSN： 0885-6125
Source： Machine Learning, Vol.64, Iss.1-3, 2006-09, pp. : 121-144
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 structure of logarithmic advice complexity classes
Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. :
Access to resources
Recommend
Index sets and presentations of complexity classes
By Regan K.W.
Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. :
The complexity of subgraph isomorphism for classes of partial k-trees
Theoretical Computer Science, Vol. 164, Iss. 1, 1996-09 ,pp. :
Gap-languages and log-time complexity classes
Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. :
Recursion theoretic characterizations of complexity classes of counting functions
Theoretical Computer Science, Vol. 163, Iss. 1, 1996-08 ,pp. :