Abstract:For the problem of computing the rank of a matrix we have a complexity result and a practical implementation, both of which apply best to the case of a matrix whose rank is substantially smaller than ...For the problem of computing the rank of a matrix we have a complexity result and a practical implementation, both of which apply best to the case of a matrix whose rank is substantially smaller than its order.Read More
Publication Year: 2009
Publication Date: 2009-07-28
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 9
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot