Computability and the Implicit Function Theorem
From MaRDI portal
Publication:4921433
DOI10.1016/j.entcs.2006.08.004zbMath1262.03142OpenAlexW1965247588MaRDI QIDQ4921433
Publication date: 10 May 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2006.08.004
Constructive and recursive analysis (03F60) Implicit function theorems, Jacobians, transformations with several variables (26B10) Implicit function theorems; global Newton methods on manifolds (58C15)
Cites Work
This page was built for publication: Computability and the Implicit Function Theorem