327 search results - page 4 / 66 » Some Elimination Problems for Matrices |
ISSAC
2007
Springer
14 years 4 months ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
IPPS
2000
IEEE
14 years 2 months ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
CCDS
2010
13 years 7 months ago
2010
We outline a discretization approach to determine the maximal number of mutually unbiased bases in dimension 6. We describe the basic ideas and introduce the most important definit...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutines satisfiability modulo this theory and polyhedral pro...
4OR
2010
13 years 9 months ago
2010
s (from Seminario Dottorato's web page) 3 Notes of the seminars 9 Nicola Mazzari, A note on Grothendieck fundamental group . . . . . . . . . . . . . . 9 Marco Formentin, Infor...