Question
The time complexity of the Strassenās algorithm for
matrix multiplication is:Solution
Strassenās algorithm is an advanced matrix multiplication method that improves on the naive O(nĀ³) approach. It achieves O(nĀ².āøā°ā·) complexity using divide and conquer.
Consider the following statements about the PM SVANidhi Scheme:
1.Ā Ā Ā Ā Ā Ā Ā Ā The scheme provides a working capital loan of up to ā¹10,000...
The Union Cabinet has recently approved a comprehensive Export Promotion Mission (EPM) aimed at strengthening Indiaās export competitiveness, improvin...
Which of the following is not a feature of the e-NAM platform?
__________ aids to set up a network of technology centres and to set up incubation centres to accelerate entrepreneurship and also to promote startups ...
Government of India has come up with several initiatives for preventing discrimination against women at the workplace as well as increasing participatio...
What is the estimated investment approved for the 12 new industrial cities under NICDP?
The Swashakt Programme, which focuses on addressing evidence gaps and unlocking economic opportunities for women in farm and non-farm sectors, is suppor...
Consider the following Statements.
(I) WPI tracks inflation at the wholesale level and CPI captures changes in prices levels at the consumer l...
Which organisation collects samples to determine the Poverty Line in India?
What is the primary goal of the Ayushman Bhav Campaign launched by the President of India?
Relevant for Exams:
