Author： Lu L.-Z.
Publisher： Springer Publishing Company
ISSN： 0254-5330
Source： Annals of Operations Research, Vol.98, Iss.1-4, 2000-12, pp. : 141-148
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
On robust matrix completion with prescribed eigenvalues
Future Generation Computer Systems, Vol. 19, Iss. 7, 2003-10 ,pp. :
Access to resources
Recommend
Some complexity bounds for subtype inequalities
By Benke M.
Theoretical Computer Science, Vol. 212, Iss. 1, 1999-02 ,pp. :
Lower bounds for some decision problems over C
By Malajovich
Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. :