scientific article
From MaRDI portal
Publication:4011259
zbMath0746.65108MaRDI QIDQ4011259
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitylinear programmingpath-following algorithmsdecision methodsquantifier-free formulafirst order theory of realsill-posed problem instancespolynomial-time boundsquantifier elimination methodssequential bit operation bound
Numerical mathematical programming methods (65K05) Linear programming (90C05) Complexity and performance of numerical algorithms (65Y20)
Related Items (2)
On the complexity of quadratic programming in real number models of computation ⋮ Complexity yardsticks for \(f\)-vectors of polytopes and spheres
This page was built for publication: