𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of some special types of timetabling problems

✍ Scribed by D. de Werra; A. S. Asratian; S. Durand

Publisher
Springer US
Year
2002
Tongue
English
Weight
149 KB
Volume
5
Category
Article
ISSN
1094-6136

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