Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
Re:矩阵的特点是可以把乘法复杂度降到O(N^2)的In Reply To:矩阵的特点是可以把乘法复杂度降到O(N^2)的 Posted by:YUMEN19850720 at 2007-03-23 09:25:46 N^2 ………………一般的矩阵怎么可能…… Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator