![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Muchnik A.A. Vereshchagin N.K.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.157, Iss.2, 1996-05, pp. : 227-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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
General linear relations between different types of predictive complexity
By Kalnishkan
Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Complexity parameters for first order classes
By Arias Marta
Machine Learning, Vol. 64, Iss. 1-3, 2006-09 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
The structure of logarithmic advice complexity classes
Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Index sets and presentations of complexity classes
By Regan K.W.
Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. :