scientific article; zbMATH DE number 503383

MaRDI QIDQ4279722zbMATH OpenFDO

Authors Michael Shub

Publication date 10 March 1994

zbMATH Keywords

complexity of computationscomputations over general ringsdifferential topologydynamic systemslinear programmingNewton's methodNP- completenessnumerical analysissimplex method

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Cited in

(5)

• On the complexity of quadratic programming in real number models of computation
• Complexity of Bezout's theorem. V: Polynomial time
• Smale's theory
• scientific article; zbMATH DE number 1502617 (Why is no real title available?)
• Some computational aspects in the work of Patrick Dehornoy

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 Q4279722)