Open problems in computational linear algebra
โ Scribed by S.K. Sen
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 120 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0362-546X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We consider the computational complexity of some problems dealing with matrix rank. Let E, S be subsets of a commutative ring R. Let x 1 , x 2 , ..., x t be variables. Given a matrix M=M(x 1 , x 2 , ..., x t ) with entries chosen from E \_ [x 1 , x 2 , ..., x t ], we want to determine maxrank S (M)=
Problem submissions should be precise and succinct. Proposals for guest columns, focusing on problems in a specific research area, are also welcome. Especially welcome are algorithmic problems arising in areas not previously explored by the theoretical computer science community. This column is a