Dipòsit Digital de Documents de la UABmetadata only
On the worst case complexity of potential reduction algorithms for linear programming
interior point methods, lower bounds on complexity, potential reduction algorithms
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 429995
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.