HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Efficient programming in maple : a case study

Bruno Salvy 1
1 ALGO - Algorithms
Inria Paris-Rocquencourt
Abstract : Studying the computation of orbits of some given group acting on a set, we show how successive refinements of a simple program provide a speedup factor of up to 200. The initial program cannot solve the problem at all, it is first converted into a program which needs one c.p.u. week and after all the optimizations have been performed, the computation takes only four hours. Although the problem is pecific, we shall show that many of the optimizations we use are of interest for other problems as well.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 5:02:48 PM
Last modification on : Friday, February 4, 2022 - 3:10:04 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:56:44 PM


  • HAL Id : inria-00074949, version 1



Bruno Salvy. Efficient programming in maple : a case study. [Research Report] RR-1611, INRIA. 1992. ⟨inria-00074949⟩



Record views


Files downloads