A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing

2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)(2016)

引用 117|浏览140
暂无评分
摘要
Symbolic matrices in non-commuting variables, andthe related structural and algorithmic questions, have a remarkablenumber of diverse origins and motivations. They ariseindependently in (commutative) invariant theory and representationtheory, linear algebra, optimization, linear system theory,quantum information theory, and naturally in non-commutativealgebra.
更多
查看译文
关键词
Non-commutative computation,Rational identity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要