In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representation. The computation of the zero set is based on topological index theory, the most powerful tool for finding robust solutions of equations
AbstractThe invariance of the topological degree under certain homotopies is used to computationally...
AbstractThe computation of reachable sets of nonlinear dynamic and control systems is an important p...
AbstractWe study topological games motivated by selection procedures for families of open sets. We e...
AbstractIn this note we give a new representation for closed sets under which the robust zero set of...
htmlabstractIn this note we give a new representation for closed sets under which the robust zero se...
The relationship between the structure of a domain and the complexity of computing over that domain ...
International audienceComputable analysis is the theoretical study of the abilities of algorithms to...
The computation of reachable sets of nonlinear dynamic and control systems is an important problem o...
AbstractIn an earlier paper by the authors in this issue (J. Math. Anal. Appl. 160, 1991) various ne...
We provide a self-contained introduction into Weihrauch complexity and its applications to computabl...
The TTE approach to Computable Analysis is the study of so-calledrepresentations (encodings for cont...
We study robust properties of zero sets of continuous maps f: X → ℝn. Formally, we analyze the famil...
AbstractThe topological complexity of zero-finding is studied using a BSS machine over the reals wit...
AbstractIn this paper we extend computability theory to the spaces of continuous, upper semi-continu...
AbstractIn previous papers we have presented a unified Type 2 theory of computability and continuity...
AbstractThe invariance of the topological degree under certain homotopies is used to computationally...
AbstractThe computation of reachable sets of nonlinear dynamic and control systems is an important p...
AbstractWe study topological games motivated by selection procedures for families of open sets. We e...
AbstractIn this note we give a new representation for closed sets under which the robust zero set of...
htmlabstractIn this note we give a new representation for closed sets under which the robust zero se...
The relationship between the structure of a domain and the complexity of computing over that domain ...
International audienceComputable analysis is the theoretical study of the abilities of algorithms to...
The computation of reachable sets of nonlinear dynamic and control systems is an important problem o...
AbstractIn an earlier paper by the authors in this issue (J. Math. Anal. Appl. 160, 1991) various ne...
We provide a self-contained introduction into Weihrauch complexity and its applications to computabl...
The TTE approach to Computable Analysis is the study of so-calledrepresentations (encodings for cont...
We study robust properties of zero sets of continuous maps f: X → ℝn. Formally, we analyze the famil...
AbstractThe topological complexity of zero-finding is studied using a BSS machine over the reals wit...
AbstractIn this paper we extend computability theory to the spaces of continuous, upper semi-continu...
AbstractIn previous papers we have presented a unified Type 2 theory of computability and continuity...
AbstractThe invariance of the topological degree under certain homotopies is used to computationally...
AbstractThe computation of reachable sets of nonlinear dynamic and control systems is an important p...
AbstractWe study topological games motivated by selection procedures for families of open sets. We e...
DOI
Add to ORKG