<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>article</genre>

<titleInfo><title>Robust satisfiability of systems of equations</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Peter</namePart>
  <namePart type="family">Franek</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Marek</namePart>
  <namePart type="family">Krcál</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">33E21118-F248-11E8-B48F-1D18A9856A87</identifier></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">UlWa</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>

<name type="corporate">
  <namePart></namePart>
  <identifier type="local">HeEd</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>








<abstract lang="eng">We study the problem of robust satisfiability of systems of nonlinear equations, namely, whether for a given continuous function f:K→ ℝn on a finite simplicial complex K and α &amp;gt; 0, it holds that each function g: K → ℝn such that ||g - f || ∞ &amp;lt; α, has a root in K. Via a reduction to the extension problem of maps into a sphere, we particularly show that this problem is decidable in polynomial time for every fixed n, assuming dimK ≤ 2n - 3. This is a substantial extension of previous computational applications of topological degree and related concepts in numerical and interval analysis. Via a reverse reduction, we prove that the problem is undecidable when dim K &amp;gt; 2n - 2, where the threshold comes from the stable range in homotopy theory. For the lucidity of our exposition, we focus on the setting when f is simplexwise linear. Such functions can approximate general continuous functions, and thus we get approximation schemes and undecidability of the robust satisfiability in other possible settings.</abstract>

<originInfo><publisher>ACM</publisher><dateIssued encoding="w3cdtf">2015</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Journal of the ACM</title></titleInfo>
  <identifier type="arXiv">1402.0858</identifier>
  <identifier type="ISI">000361200500001</identifier><identifier type="doi">10.1145/2751524</identifier>
<part><detail type="volume"><number>62</number></detail><detail type="issue"><number>4</number></detail>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<ista>Franek P, Krcál M. 2015. Robust satisfiability of systems of equations. Journal of the ACM. 62(4), 26.</ista>
<ieee>P. Franek and M. Krcál, “Robust satisfiability of systems of equations,” &lt;i&gt;Journal of the ACM&lt;/i&gt;, vol. 62, no. 4. ACM, 2015.</ieee>
<ama>Franek P, Krcál M. Robust satisfiability of systems of equations. &lt;i&gt;Journal of the ACM&lt;/i&gt;. 2015;62(4). doi:&lt;a href=&quot;https://doi.org/10.1145/2751524&quot;&gt;10.1145/2751524&lt;/a&gt;</ama>
<short>P. Franek, M. Krcál, Journal of the ACM 62 (2015).</short>
<mla>Franek, Peter, and Marek Krcál. “Robust Satisfiability of Systems of Equations.” &lt;i&gt;Journal of the ACM&lt;/i&gt;, vol. 62, no. 4, 26, ACM, 2015, doi:&lt;a href=&quot;https://doi.org/10.1145/2751524&quot;&gt;10.1145/2751524&lt;/a&gt;.</mla>
<chicago>Franek, Peter, and Marek Krcál. “Robust Satisfiability of Systems of Equations.” &lt;i&gt;Journal of the ACM&lt;/i&gt;. ACM, 2015. &lt;a href=&quot;https://doi.org/10.1145/2751524&quot;&gt;https://doi.org/10.1145/2751524&lt;/a&gt;.</chicago>
<apa>Franek, P., &amp;#38; Krcál, M. (2015). Robust satisfiability of systems of equations. &lt;i&gt;Journal of the ACM&lt;/i&gt;. ACM. &lt;a href=&quot;https://doi.org/10.1145/2751524&quot;&gt;https://doi.org/10.1145/2751524&lt;/a&gt;</apa>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>1682</recordIdentifier><recordCreationDate encoding="w3cdtf">2018-12-11T11:53:27Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2025-09-23T10:38:46Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
