๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The computational complexity of multi-level linear programs

โœ Scribed by Charles Blair

Book ID
112693160
Publisher
Springer US
Year
1992
Tongue
English
Weight
369 KB
Volume
34
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The computational complexity of some fuz
The computational complexity of some fuzzy dynamic programs
โœ A.O. Esogbue ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 292 KB

Fuzzy dynamic programming, a natural extension of classical dynamic programming, is of great appeal in the modeling and control of certain systems, especially those of a socio-technical systems nature. However, data acquisition, manipulation, and processing create immense problems to the systems des

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