The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract)

Jonathan F. Buss,Gudmund Skovbjerg Frandsen,Jeffrey Shallit

STACS（1997）

引用 2|浏览22

暂无评分

摘要

In this paper we consider the computational complexity of some problems dealing with matrix rank. Let E, S be subsets of a commutative ring R. Let x1, x2, ..., xt be variables. Given a matrix M= M(x1, x2, ..., xt) with entries chosen from E ∪ {x1, x2, ..., xt}, we want to determine

查看译文

关键词

extended abstract,computational complexity,linear algebra,commutative ring

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要