Author： Regan K.W.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.161, Iss.1, 1996-07, pp. : 263-287
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
Complexity results for triangular sets
By Schost E.
Journal of Symbolic Computation, Vol. 36, Iss. 3, 2003-09 ,pp. :
Access to resources
Recommend
Reducibility classes of P-selective sets
By Hemaspaandra L.A. Hoene A. Ogihara M.
Theoretical Computer Science, Vol. 155, Iss. 2, 1996-03 ,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. :
Query complexity of membership comparable sets
By Tantau T.
Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. :