Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7057309
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 28, 20262026-05-28T03:58:14+00:00 2026-05-28T03:58:14+00:00

When multiplying two matrices, we need to allocate a third one to store the

  • 0

When multiplying two matrices, we need to allocate a third one to store the result. Should this allocation be considered when calculating the memory consumption of the algorithm?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-28T03:58:15+00:00Added an answer on May 28, 2026 at 3:58 am

    I can’t imagine an argument that the space required for an algorithm is less than what is required to store the result; that should be the lower bound of the space required.

    But apparently my imagination is not up to the task at hand, and neither the space for the input parameters nor the space for the output/result should be counted against the algorithm.

    So (as the comments below have convinced me): no.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

This is my matrix code. I am multiplying two matrices. One of the matrices
As a single operation between two positive integers we understand multiplying one of the
Is there an algorithm for accurately multiplying two arbitrarily long integers together? The language
How would I go about... multiplying two 64-bit numbers multiplying two 16-digit hexadecimal numbers
I need to multiply an integer (two's compliment) by a floating point constant. Here
Multiplying two binary numbers takes n^2 time, yet squaring a number can be done
Trying to write a matrix-multiplying function for arbitrary-sized matrices in C. I'm trying the
Multiplying two numbers in log space means adding them: log_multiply(x, y) = log( exp(x)
I have two matrices (A and B), 2-dimensions. And i think i'll speed up
multiplying each pixel by the average blurring mask *(1/9) but the result is totally

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.