Combining polynomial running time and fast convergence for the disk-covering method

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.

Previous Menu Next

Abstract

Related content

An asymptotic fully polynomial time approximation scheme for bin covering

By Jansen K. Solis-Oba R.

Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. : 543-551

Elsevier

Access to resources Recommend Favorite

Convergence of the least-squares method with a polynomial regularizer for the infinite-dimensional autoregression equation

By Barabanov A. Gel’ Yu.

Automation and Remote Control, Vol. 66, Iss. 1, 2005-01 ,pp. : 92-107

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Fast nonlinear finite element analysis using Newton-Raphson method implemented by Krylov subspace method with relaxed convergence criterion

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. : 1537-1552

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Relating polynomial time to constant depth

By Vollmer H.

Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. : 159-170

Elsevier

Access to resources Recommend Favorite

Criteria for Polynomial-Time (Conceptual) Clustering

By Pitt L.

Machine Learning, Vol. 02, Iss. 4, 1988-04 ,pp. : 371-396

Springer Publishing Company

Access to resources Recommend Favorite