MathGroup Archive 2004

[Date Index] [Thread Index] [Author Index]

Search the Archive

Time & space complexity for built-in-functions

  • To: mathgroup at
  • Subject: [mg50988] Time & space complexity for built-in-functions
  • From: "E. Martin-Serrano" <EmilioMartin-Serrano at>
  • Date: Fri, 1 Oct 2004 04:48:02 -0400 (EDT)
  • Sender: owner-wri-mathgroup at


I would need the time (and space) complexity of those built-in-functions
under the title List and Matrices in the Mathematica Help Browser. The
same for those structure related functions in the packages
LinearAlgebra`MatrixManipulation and Statistics`DataManiputation.  Mere
approximations would not help, since that is what I am doing now and is
very inconvenient. Some approximation could be inferred or guessed for
certain functions but it takes to much to verify whether the guess is

Any help, both, from Wolfram and the Group would be appreciated.

Have fun,

E. Mart=EDn-Serrano

  • Prev by Date: Re: Linear Programming
  • Next by Date: Re : MultipleListPlot
  • Previous by thread: Re: Fast multiplication of polynomials mod p
  • Next by thread: Re : MultipleListPlot