Robust satisfiability of systems of equations

DOI10.1137/1.9781611973402.14MaRDI QIDQ5383973zbMATH OpenOpenAlexFDO

Authors Peter Franek, Marek Krčál

Publication date 20 June 2019

Published in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973402.14

Mathematics Subject Classification ID

Functions of several variables (26B99) Numerical computation of solutions to systems of equations (65H10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Robust satisfiability of systems of equations
• Satisfiability of systems of equations of real analytic functions is quasi-decidable
• Quasi-decidability of a fragment of the first-order theory of real numbers
• Solving equations and optimization problems with uncertainty
• scientific article; zbMATH DE number 4213455

Cited in

(7)

• Solving equations and optimization problems with uncertainty
• On computability and triviality of well groups
• Satisfiability of systems of equations of real analytic functions is quasi-decidable
• Robust satisfiability of systems of equations
• Robustness of Solutions of Almost Every System of Equations
• Decidability of the extension problem for maps into odd-dimensional spheres
• Robust feasibility of systems of quadratic equations using topological degree theory

This page was built for publication: Robust satisfiability of systems of equations

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