Robust Satisfiability of Systems of Equations

DOI10.1145/2751524zbMath1423.68208arXiv1402.0858OpenAlexW2058175730MaRDI QIDQ3177731

Peter Franek, Marek Krčál

Publication date: 2 August 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.0858

zbMATH Keywords

undecidabilitynonlinear equationssatisfiabilitytopological extension

Mathematics Subject Classification ID

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

Related Items (4)

Robust feasibility of systems of quadratic equations using topological degree theory ⋮ Quasi-decidability of a fragment of the first-order theory of real numbers ⋮ Computation of Cubical Steenrod Squares ⋮ Computing simplicial representatives of homotopy group elements

This page was built for publication: Robust Satisfiability of Systems of Equations