V. Strassen. "Gaussian Elimination is not Optimal." Numerische Mathematik, Vol 13, No 3. 1969. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
The Fastest And Shortest Algorithm For All Well-Defined Problems - Hutter (2002) (5 citations) (Correct)
Fast Monte-Carlo Algorithms for Approximate Matrix.. - Drineas, Kannan (2001) (Correct)
Self Adapting Software for Numerical Linear Algebra.. - Chen, Dongarra.. (2003) (Correct)
On the Complexity of Polynomial Matrix Computations - Giorgi, Jeannerod (2003) (Correct)
SIMD Algorithms for Matrix Multiplication on the Hypercube - Sanches, Song (Correct)
All Pairs Shortest Paths Algorithms - Takaoka, Cook (1999) (Correct)
On the Complexity of Matrix Product - Raz (2002) (5 citations) (Correct)
Numerical Analysis in the Twentieth Century - Brezinski, Wuytack (2001) (Correct)
Fast Multiplication And Its Applications - Bernstein (Correct)
Attacks based on Conditional Correlations against the Nonlinear.. - Löhlein (2003) (Correct)
Computing the Sign Or the Value of the Determinant of an.. - Kaltofen, Villard (2002) (Correct)
A First Report on the Stream Ciphers SOBER-t16 and SOBER-t32 - Schafheutle (2001) (Correct)
Cryptanalysis of LILI-128 - Babbage (2001) (2 citations) (Correct)
Matrix Inversion Made Difficult - Bernstein (Correct)
Computing Elementary Symmetric Polynomials with a Sub-Polynomial .. - Grolmusz (2002) (Correct)
The Performance of the Intel TFLOPS Supercomputer - Henry, Fay, Cole, Mattson (3 citations) (Correct)
Portable High-Performance Programs - Frigo (1992) (1 citation) (Correct)
Integrating symmetry breaking into a DLL procedure - Li, Jurkowiak, Purdom, Jr. (2002) (4 citations) (Correct)
Lower Bounds for g-Cuts on Multi-Dimensional Rectangular Grids - Galtier (1996) (Correct)
Exploring the Tera MTA by Example - Stork (2000) (Correct)
Accelerating Cryptanalysis with the Method of Four Russians - Gregory Bard July (2006) (Correct)
Achieving a log(n) Speed Up for Boolean Matrix Operations and - Calculating The Complexity (2006) (Correct)
The Algebraic Structure of Attributed Type Signatures - Penn (2000) (4 citations) (Correct)
SFINKS: A Synchronous Stream Cipher for Restricted .. - Braeken, Lano.. (2005) (1 citation) (Correct)
Extending the Resynchronization Attack - Armknecht, Lano, Preneel (2004) (Correct)
Essentially Optimal Computation of the Inverse of Generic.. - Jeannerod (Correct)
Computing Elementary Symmetric Polynomials with a Sub-Polynomial .. - Grolmusz (2002) (Correct)
On the Complexity of Polynomial Matrix Computations - Giorgi, Jeannerod, Villard (2003) (Correct)
Exact and Approximate Distances in Graphs - a survey - Zwick (2001) (8 citations) (Correct)
Algebras of Minimal Rank over Arbitrary Fields - Bläser (Correct)
From Heterogeneous Task Scheduling to Heterogeneous Mixed Data.. - Suter, al. (2003) (Correct)
A 5/2 n²-Lower Bound for the Multiplicative Complexity of n.. - Bläser (Correct)
Near Quadratic Matrix Multiplication Modulo Composites - Grolmusz (2003) (Correct)
Communication Lower Bounds for Distributed-Memory Matrix.. - Irony, Toledo (2004) (Correct)
The Design and Analysis of Bulk-Synchronous Parallel Algorithms - Tiskin (1998) (7 citations) (Correct)
Computing Elementary Symmetric Polynomials with a Sub-Polynomial .. - Grolmusz (2002) (Correct)
The Design and Analysis of Bulk-Synchronous Parallel Algorithms - Tiskin (1998) (7 citations) (Correct)
Algebras of Minimal Rank over Arbitrary Fields - Bläser (2002) (Correct)
Practical Parallel Divide-and-Conquer Algorithms - Hardwick (1997) (1 citation) (Correct)
Recursive Array Layouts and Fast Matrix Multiplication - Chatterjee, Lebeck.. (1999) (13 citations) (Correct)
Behaviour Analysis of Communication Systems: Compositional.. - Siegle (2002) (1 citation) (Correct)
Matrix Factorization Using a Block-Recursive Structure and.. - Frens (Correct)
Algebras of Minimal Rank over Perfect Fields - Bläser (2001) (Correct)
Recursive Array Layouts and Fast Parallel Matrix.. - Chatterjee, Lebeck.. (1999) (17 citations) (Correct)
Nonlinear Array Layouts for Hierarchical Memory Systems - Chatterjee, Jain.. (1999) (50 citations) (Correct)
Fast Solvers and Domain Decomposition Preconditioners for.. - Hientzsch (2001) (Correct)
On the 2 × 2 Matrix Multiplication - Bshouty (Correct)
On Improving the Memory Access Patterns During the Execution .. - ElGindy, Ferizis Self-citation (Strassen) (Correct)
Fast Multiplication of Interval Matrices - Interval Version Of (2003) Self-citation (Strassen) (Correct)
A Scalable Parallel Strassen's Matrix Multiply Algorithm for . . . - Luo, Drake (1 citation) Self-citation (Strassen) (Correct)
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC