On the complexity of linear programming in the BSS-model

DOI10.1016/S0166-218X(99)00063-3MaRDI QIDQ1302143zbMATH OpenWikidataFDO

Authors G. Bär

Publication date 14 June 2000

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0166-218X(99)00063-3

zbMATH Keywords

BSS-modelcomplexity

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 19091
• scientific article; zbMATH DE number 898014
• scientific article; zbMATH DE number 1759478
• scientific article; zbMATH DE number 1163110
• Complexity of linear relaxations in integer programming
• scientific article; zbMATH DE number 2010046
• On the complexity of linear programming under finite precision arithmetic
• The computational complexity of multi-level linear programs
• Publication:5753757
• The complexity of linear programming in \((\gamma ,\kappa )\)-form

Cited in

(3)

• scientific article; zbMATH DE number 3858831 (Why is no real title available?)
• scientific article; zbMATH DE number 1759478 (Why is no real title available?)
• Some lower bounds for the complexity of the linear programming feasibility problem over the reals

This page was built for publication: On the complexity of linear programming in the BSS-model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1302143)