![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Pitt L.
Publisher: Springer Publishing Company
ISSN: 0885-6125
Source: Machine Learning, Vol.02, Iss.4, 1988-04, pp. : 371-396
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)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Polynomial-Time Decomposition Algorithms for Support Vector Machines
By Hush D.
Machine Learning, Vol. 51, Iss. 1, 2003-04 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Bounding queries in the analytic polynomial-time hierarchy
Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
A Polynomial-Time Parsing Algorithm for K -Depth Languages
Journal of Computer and System Sciences, Vol. 52, Iss. 1, 1996-02 ,pp. :