Author:
B�rgisser Peter,Karpinski Marek,Lickteig Thomas
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference20 articles.
1. A. V. Aho, J. E. Hopcroft, andJ. D. Ullman,The design and analysis of computer algorithms, Reading MA: Addison-Wesley, 1974.
2. A. Alder andV. Strassen,On the algorithmic complexity of associative algebras, Theor. Computer Science15 (1981), 201?211.
3. W. Baur andV. Strassen,The complexity of partial derivatives. Theor. Computer Science22 (1982), 317?330.
4. L. Blum, M. Shub, andS. Smale,On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc.21 (1989), 1?46.
5. J. Bunch andJ. Hopcroft,Triangular factorization, and inversion by fast matrix multiplication, Math. Comp.28 (1974), 231?236.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献