The complexity of linear programming (Q5904897): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orientability of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming is log-space hard for P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Solve Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Commodity Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simplex algorithm with the pivot rule of maximizing criterion improvement / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient search for rationals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zufällige konvexe Polyeder im \(n\)-dimensionalen Euklidischen Raum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5733470 / rank
 
Normal rank

Revision as of 12:55, 13 June 2024

scientific article; zbMATH DE number 3737374
Language Label Description Also known as
English
The complexity of linear programming
scientific article; zbMATH DE number 3737374

    Statements

    Identifiers