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

Linear Problems and Linear Algorithms

โœ Scribed by B.Curtis Eaves; Uriel G. Rothblum

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
356 KB
Volume
20
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Parallel Output-Sensitive Algorithms for
Parallel Output-Sensitive Algorithms for Combinatorial and Linear Algebra Problems
โœ John H. Reif ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 160 KB

This paper gives output-sensitive parallel algorithms whose performance depends on the output size and are significantly more efficient tan previous algorithms for problems with sufficiently small output size. Inputs are n\_n matrices over a fixed ground field. Let P(n) and M(n) be the PRAM processo

Efficient Theoretic and Practical Algori
Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems
โœ Harold N. Gabow; Ying Xu ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 754 KB

Efficient algorithms for the matroid intersection problem, both cardinality and weighted versions, are presented. The algorithm for weighted intersection works by scaling the weights. The cardinality algorithm is a special case, but takes advantage of greater structure. Efficiency of the algorithms