Primitive recursive ordered fields and some applications
From MaRDI portal
Publication:5880940
Cites work
- scientific article; zbMATH DE number 3863189 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1746051 (Why is no real title available?)
- scientific article; zbMATH DE number 1390542 (Why is no real title available?)
- scientific article; zbMATH DE number 3305793 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- A note on computable real fields
- Algorithms in real algebraic geometry
- An inequality for the discriminant of a polynomial
- Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
- Bit-complexity of solving systems of linear evolutionary partial differential equations
- Computable Algebra, General Theory and Theory of Computable Fields
- Computational complexity of real powering and improved solving linear differential equations
- Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs
- Degree spectra of real closed fields
- Effective procedures in field theory
- Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Fields of algebraic numbers computable in polynomial time. I
- Is it harder to factor a polynomial or to find a root?
- Lipschitz continuous ordinary differential equations are polynomial-space complete
- Nonconstructivizability of certain ordered fields of real numbers
- On constructive number fields and computability of solutions of PDEs
- On the computational complexity of the Dirichlet problem for Poisson's equation
- Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving
- Polynomial-time presentations of algebraic number fields
- Polynomial-time versus recursive models
- Primitive recursive fields and categoricity
- Primitive recursive ordered fields and some applications
- Primitive recursive real numbers
- Recursive analysis
- Solving analytic differential equations in polynomial time over unbounded domains
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)
