This topic contains 0 replies, has 0 voices, and was last updated by  EduGorilla 2 years, 6 months ago.

  • Author
    Posts
  • #1427769 Reply
     EduGorilla 
    Keymaster
    Select Question Language :


    Professor Caesar wishes to develop a matrix-multiplication algorithm that is asymptotically faster than Strassen’s algorithm. His algorithm will use the divide and- conquer method, dividing each matrix into pieces of size n/4 x n/4, and the divide and combine steps together will take Ɵ(n2) time. He needs to determine how many sub-problems his algorithm has to create in order to beat Strassen’s algorithm. If his algorithm creates ‘a’ sub-problems, then the recurrence for the running time T(n) becomes T(n) = aT(n/4) + Ɵ(n2) . What is the largest integer value of ‘a’ for which Professor Caesar’s algorithm would be asymptotically faster than Strassen’s algorithm ___________________.

    Options :-

      Post your Training /Course Enquiry
      Are You looking institutes / coaching center for
      • IIT-JEE, NEET, CAT
      • Bank PO, SSC, Railways
      • Study Abroad
      Select your Training / Study category
    Reply To: Professor Caesar wishes to develop a matrix-multiplication algorithm that is asymptotically faster t….
    Your information:




    Verify Yourself




    Log in with your credentials

    or    

    Forgot your details?

    Create Account