Author: Lagergren J.
Publisher: Academic Press
ISSN: 0022-0000
Source: Journal of Computer and System Sciences, Vol.65, Iss.3, 2002-11, pp. : 481-493
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
An asymptotic fully polynomial time approximation scheme for bin covering
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :
By Okamoto Yoshifumi Kameari Akihisa Fujiwara Koji Tsuburaya Tomonori Sato Shuji
COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol. 34, Iss. 5, 2015-09 ,pp. :
Relating polynomial time to constant depth
By Vollmer H.
Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. :
Criteria for Polynomial-Time (Conceptual) Clustering
By Pitt L.
Machine Learning, Vol. 02, Iss. 4, 1988-04 ,pp. :