Research work · 2011
Recent progress in linear algebra and lattice basis reduction
Gilles Villard
International Symposium on Symbolic and Algebraic Computation
Abstract
A general goal concerning fundamental linear algebra problems is to reduce the complexity estimates to essentially the same as that of multiplying two matrices (plus possibly a cost related to the input and output sizes). Among the bottlenecks one usually finds the questions of designing a recursive approach and mastering the sizes of the intermediately computed data.