To fans/experts of symbolic computation:   
      
   I have a a sparse, nonsingular, linear system of equations for n = 16 unknowns.   
      
   I want to a symbolic solution in an expression as simple as current techniques   
   can achieve. I have used both Mathematica and Maple. The solution expression   
   is identical (good) but very long (undesirable).   
      
   I have a few questions:   
      
    1. Empirically, Maple returns the solution much faster. Why?   
      
    2. Theoretically, what is the complexity in symbolic operations to get the   
   solution expressions? And what is the complexity for the solution to be   
   evaluated?   
      
    3. Is there any special method or toolbox to explore sparsity?   
      
   Thank you in advance for any constructive suggestions or pointers to related   
   literature!   
      
   Nikos   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)