摘要 : Let Λ be the four subspace algebra. We show that for any Λ-module M there exists an algorithm (up to the problem of finding roots of the so-called characteristic polynomial of M) with relatively low polynomial complexity of determ... 展开
作者 | Mróz~ A. |
---|---|
作者单位 | |
期刊名称 | 《Communications in algebra》 |
总页数 | 32 |
语种/中图分类号 | 英语 / O15 |
关键词 | Four subspace problem Isomorphism problem Multiplicity problem |
馆藏号 | N2008EPST0000651 |