Author： Puricella A. Stewart I.A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.290, Iss.3, 2003-01, pp. : 1897-1913
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-theoretic models of phase transitions in search problems
By Dunne P.E. Gibbons A. Zito M.
Theoretical Computer Science, Vol. 249, Iss. 2, 2000-10 ,pp. :
Access to resources
Recommend
The classification of greedy algorithms
By Curtis S.A.
Science of Computer Programming, Vol. 49, Iss. 1, 2003-12 ,pp. :
Recursion theoretic characterizations of complexity classes of counting functions
Theoretical Computer Science, Vol. 163, Iss. 1, 1996-08 ,pp. :
Monotonicity Maintenance in Information-Theoretic Machine Learning Algorithms
By Ben-David A.
Machine Learning, Vol. 19, Iss. 1, 1995-04 ,pp. :