𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of a special basis problem in LP

✍ Scribed by Katta G. Murty

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
272 KB
Volume
47
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the complexity of recursion in proble
On the complexity of recursion in problem-solving
✍ M.C. Er πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science βš– 426 KB

The importance of paying attention to the complexity of recursion in problem solving is stressed. Many ill-founded beliefs and doctrines on constructing recursive algorithms are challenged. The Tower of Hanoi problem and its variant are used as concrete examples for illustrating that many seemingly

On a Linear Diophantine Problem of Frobe
On a Linear Diophantine Problem of Frobenius: Extending the Basis
✍ Stefan Matthias Ritter πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 233 KB

Let X k =[a 1 , a 2 , ..., a k ], k>1, be a subset of N such that gcd(X k )=1. We shall say that a natural number n is dependent (on X k ) if there are nonnegative integers x i such that n has a representation n= k i=1 x i a i , else independent. The Frobenius number g(X k ) of X k is the greatest i