Primitive recursive ordered fields and some applications
From MaRDI portal
Publication:831997
DOI10.1007/978-3-030-85165-1_20OpenAlexW3197157512MaRDI QIDQ831997FDOQ831997
Authors: Victor Selivanov, Svetlana V. Selivanova 
Publication date: 24 March 2022
Full work available at URL: https://arxiv.org/abs/2010.10189
polynomialroot-findingsplittingreal closureordered fieldprimitive recursionsolution operators of PDEs
Cites Work
- Title not available (Why is that?)
- Solving analytic differential equations in polynomial time over unbounded domains
- Title not available (Why is that?)
- 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
- The metamathematics of algebraic systems. Collected papers: 1936-1967. Translated, edited, and provided with supplementary notes by Benjamin Franklin Wells III
- Title not available (Why is that?)
- Effective procedures in field theory
- Computable Algebra, General Theory and Theory of Computable Fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving
- Recursive analysis
- Title not available (Why is that?)
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Polynomial-time presentations of algebraic number fields
- Degree spectra of real closed fields
- 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
Cited In (8)
- Computational complexity of classical solutions of partial differential equations
- Primitive recursive equivalence relations and their primitive recursive complexity
- Primitive recursive ordered fields and some applications
- Punctually presented structures I: Closure theorems
- COMPUTABLY COMPACT METRIC SPACES
- Primitive recursive reverse mathematics
- Computably and punctually universal spaces
- Title not available (Why is that?)
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 Q831997)
