UGC/CBSE NET SOLVED QUESTION PAPERS.(Computer Science)
Friday, 12 June 2015
Q35,paper3,d13 Let A and B be two n ×n matrices. The efficient algorithm to multiply the two matrices has the time complexity
(A) O(n
3
)
(B) O(n
2.81
)
(C) O(n
2.67
)
(D) O(n
2
)
Answer B.
Strassen matrix multiplication complexity is O(n
2.8074
)
No comments:
Post a Comment
Note: only a member of this blog may post a comment.
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment
Note: only a member of this blog may post a comment.