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

Relaxation, New Combinatorial and Polynomial Algorithms for the Linear Feasibility Problem

โœ Scribed by Ulrich Betke

Publisher
Springer
Year
2004
Tongue
English
Weight
228 KB
Volume
32
Category
Article
ISSN
0179-5376

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