Author： Vollmer H. Wagner K.W.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.163, Iss.1, 1996-08, pp. : 245-258
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
Learning counting functions with queries
Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. :
Access to resources
Recommend
The counting complexity of group-definable languages
By Arvind V. Vinodchandran N.V.
Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. :
Complexity parameters for first order classes
By Arias Marta
Machine Learning, Vol. 64, Iss. 1-3, 2006-09 ,pp. :
The structure of logarithmic advice complexity classes
Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. :
Index sets and presentations of complexity classes
By Regan K.W.
Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. :