On the Complexity of Computing Error Bounds
暂无分享,去创建一个
[1] Serge Lang. Survey of diophantine geometry , 1962 .
[2] G. Stewart,et al. Matrix Perturbation Theory , 1990 .
[3] K. Brown,et al. Graduate Texts in Mathematics , 1982 .
[4] J. Demmel. Open problems in numerical linear algebra , 1992 .
[5] Thomas Lickteig,et al. Semi-algebraic Complexity--Additive Complexity of Matrix Computational Tasks , 1997, J. Complex..
[6] V. Strassen. Gaussian elimination is not optimal , 1969 .
[7] Victor Y. Pan,et al. How to Multiply Matrices Faster , 1984, Lecture Notes in Computer Science.
[8] Lenore Blum,et al. Complexity and Real Computation , 1997, Springer New York.
[9] Joseph H. Silverman,et al. The arithmetic of elliptic curves , 1986, Graduate texts in mathematics.
[10] Don Coppersmith,et al. Matrix multiplication via arithmetic progressions , 1987, STOC.
[11] Nicholas J. Highham. A survey of condition number estimation for triangular matrices , 1987 .
[12] Peter A. Beling,et al. Polynomial algorithms for linear programming over the algebraic numbers , 1992, STOC '92.
[13] Gregorio Malajovich,et al. On a Transfer Theorem for the P != NP Conjecture , 2001, J. Complex..
[14] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[15] Mei Han An,et al. accuracy and stability of numerical algorithms , 1991 .
[16] Gregorio Malajovich. Condition Number Bounds for Problems with Integer Coefficients , 2000, J. Complex..
[17] Walter Baur,et al. The Complexity of Partial Derivatives , 1983, Theor. Comput. Sci..
[18] Michael Clausen,et al. Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.
[19] James Demmel,et al. Applied Numerical Linear Algebra , 1997 .