Primitive recursive ordered fields and some applications
From MaRDI portal
Publication:5880940
DOI10.3233/COM-210386OpenAlexW3094559359MaRDI QIDQ5880940FDOQ5880940
Authors: Victor Selivanov, Svetlana V. Selivanova
Publication date: 9 March 2023
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/com-210386
polynomialspectral decompositionroot-findingsplittingreal closureordered fieldprimitive recursionsymmetric hyperbolic system of PDE
Cites Work
- Title not available (Why is that?)
- Solving analytic differential equations in polynomial time over unbounded domains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms in real algebraic geometry
- Lipschitz continuous ordinary differential equations are polynomial-space complete
- A note on computable real fields
- Title not available (Why is that?)
- An inequality for the discriminant of a polynomial
- Effective procedures in field theory
- Computable Algebra, General Theory and Theory of Computable Fields
- Polynomial-time versus recursive models
- Is it harder to factor a polynomial or to find a root?
- Title not available (Why is that?)
- Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving
- Recursive analysis
- Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fields of algebraic numbers computable in polynomial time. I
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Polynomial-time presentations of algebraic number fields
- Degree spectra of real closed fields
- Primitive recursive fields and categoricity
- Bit-complexity of solving systems of linear evolutionary partial differential equations
- Computational complexity of real powering and improved solving linear differential equations
- On the computational complexity of the Dirichlet problem for Poisson's equation
- Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs
- Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
- Primitive recursive real numbers
- Primitive recursive ordered fields and some applications
- Nonconstructivizability of certain ordered fields of real numbers
- On constructive number fields and computability of solutions of PDEs
Cited In (3)
This page was built for publication: Primitive recursive ordered fields and some applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5880940)