𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of Some Linear Problems with Interval Data

✍ Scribed by Jiří Rohn

Book ID
110284550
Publisher
Springer
Year
1997
Tongue
English
Weight
48 KB
Volume
3
Category
Article
ISSN
1385-3139

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Computational Complexity of Some Pro
The Computational Complexity of Some Problems of Linear Algebra
✍ Jonathan F Buss; Gudmund S Frandsen; Jeffrey O Shallit 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 330 KB

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)=