Author:
Frandsen Gudmund Skovbjerg,Frandsen Peter Frands
Subject
General Computer Science,Theoretical Computer Science
Reference18 articles.
1. Matrix Computations;Golub,1983
2. Unitäre Transformationen grosser Matrizen;Schönhage;Numer. Math.,1972
3. Fast algorithms for the characteristic polynomial;Keller-Gehrig;Theoret. Comput. Sci.,1985
4. Algebraic complexity theory;Bürgisser,1997
5. Matrix multiplication via arithmetic progressions;Coppersmith;J. Symbolic Comput.,1990
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sketches of Dynamic Complexity;ACM SIGMOD Record;2020-12-09
2. Updating Matrix Polynomials;Algorithmic Aspects in Information and Management;2019
3. Reachability Is in DynFO;Journal of the ACM;2018-09-18
4. Dynamic complexity;ACM SIGLOG News;2016-05-31
5. Reachability is in DynFO;Automata, Languages, and Programming;2015