M

Mr. Dubey • 52.30K Points
Coach 

Q. Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?

(A) true
(B) false
(C) ---
(D) ---
Correct : Option (A)

Explanation: 
 since the coppersmith- winograd algorithm multiplies the matrices in o(n2.37) time. the time complexity of recursive multiplication of two square matrices by strassen’s method is found to be o(n2.80). therefore, coppersmith-winograd

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. The transfer between CPU and Cache is

Q. The address generated by the CPU is referred to as

Q. The approach where the memory contents are transferred directly to the processor from the memory is called

Q. ,2,3,4 f(5,10,15)

Q. In a positive logic system, logic state 1 corresponds to

Q. Which command is used to display the device name of the terminal you are using?

Q. The OS X has ____________

Q. Which of the following statement is a proposition?

Q. SDLC stands for

Q. Firewalls are often configured to block