scientific article; zbMATH DE number 66626

zbMATH Open0746.65108MaRDI QIDQ4011259FDOQ4011259

Authors: James Renegar 

Publication date: 27 September 1992

Title of this publication is not available (Why is that?)

Recommendations

• Complexity of computation on real algebraic numbers
• scientific article; zbMATH DE number 48692
• scientific article; zbMATH DE number 4092769
• Real Algebraic Numbers: Complexity Analysis and Experimentation
• The complexity of the evaluation of complex algebra expressions
• scientific article; zbMATH DE number 1979264
• scientific article; zbMATH DE number 710644
• scientific article; zbMATH DE number 3928209
• scientific article; zbMATH DE number 4096783

zbMATH Keywords

computational complexitylinear programmingpath-following algorithmsdecision methodsquantifier-free formulafirst order theory of realsill-posed problem instancespolynomial-time boundsquantifier elimination methodssequential bit operation bound

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Linear programming (90C05)

Cited In (6)

• Complexity yardsticks for \(f\)-vectors of polytopes and spheres
• Title not available (Why is that?)
• Computational complexity of real powering and improved solving linear differential equations
• On the complexity of quadratic programming in real number models of computation
• On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae
• Computational complexity in algebraic systems

This page was built for publication:

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