Constructive non-commutative rank computation is in deterministic polynomial time-Reference-Cited by-同舟云学术

Constructive non-commutative rank computation is in deterministic polynomial time

Published:2018-03-22 Issue:4 Volume:27 Page:561-593
ISSN:1016-3328
Container-title:computational complexity
language:en
Short-container-title:comput. complex.

Author:

Ivanyos Gábor,Qiao Youming,Subrahmanyam K. V.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science

Link

http://link.springer.com/article/10.1007/s00037-018-0165-7/fulltext.html

Reference30 articles.

1. B. Adsul, S. Nayak & K. V. Subrahmanyam (2007). A geometric approach to the Kronecker problem II: rectangular shapes, invariants of matrices and the Artin–Procesi theorem. Preprint.

2. S. A. Amitsur (1966). Rational identities and applications to algebra and geometry. Journal of Algebra 3(3), 304–359. ISSN 0021-8693.

3. Atkinson M.D., Lloyd S. (1981) Primitive spaces of matrices of bounded rank. Journal of the Australian Mathematical Society (Series A) 30(04): 473–482

4. George W. Bergman (1969–1970). Skew fields of noncommutative rational functions (preliminary version). Séminaire Schützenberger 1, 1–18.

5. Bürgin M., Draisma J. (2006) The Hilbert null cone on tuples of matrices and bilinear forms. Mathematische Zeitschrift 254(4): 785–809

Cited by 29 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A deterministic algorithm for Harder–Narasimhan filtrations for representations of acyclic quivers;Algebra & Number Theory;2024-02-06

2. Harder-Narasimhan filtrations and zigzag persistence;Advances in Applied Mathematics;2024-02

3. The separating variety for matrix semi-invariants;Linear Algebra and its Applications;2023-10

4. Connections between graphs and matrix spaces;Israel Journal of Mathematics;2023-09

5. Generic Reed-Solomon Codes Achieve List-Decoding Capacity;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02