𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on the parallel complexity of computing the rank of order n matrices

✍ Scribed by Oscar H. Ibarra; Shlomo Moran; Louis E. Rosier

Book ID
113162206
Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
118 KB
Volume
11
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on the computation of the CP-rank
A note on the computation of the CP-rank
✍ Abraham Berman; Uriel G. Rothblum πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 114 KB
Note on complexity of computing the domi
Note on complexity of computing the domination of binary systems
✍ A.A. Chernyak; Zh.A. Chernyak πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 419 KB

The problem of computing the domination of a coherent binary system all minimal paths sets of which have equal cardinality k (k > l), is proved to be #P-complete. Some corollaries are given.