Proving an execution of an algorithm correct?
From MaRDI portal
Publication:6118838
DOI10.1007/978-3-031-42753-4_17MaRDI QIDQ6118838
Publication date: 28 February 2024
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
- Real quantifier elimination is doubly exponential
- On the integration of algebraic functions
- Factoring polynomials with rational coefficients
- Factors of iterated resultants and discriminants
- Fast recognition of alternating and symmetric Galois groups
- Validity proof of Lazard's method for CAD construction
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
- On Hensel factorization. I
- Integration of elementary functions
- A new decision method for elementary algebra
- Improving the Use of Equational Constraints in Cylindrical Algebraic Decomposition
- On propagation of equational constraints in CAD-based quantifier elimination
- Factorization in Z[x]
- A Formal Quantifier Elimination for Algebraically Closed Fields
- The Risch Differential Equation Problem
- Algebraic Properties of the Elementary Functions of Analysis
- Multivariate Polynomial Factorization
- Studies in Equisingularity II. Equisingularity in Codimension 1 (and Characteristic Zero)
- Some undecidable problems involving elementary functions of a real variable
- The Problem of Integration in Finite Terms
- Factoring Polynomials Over Large Finite Fields
- Intégration algorithmique des fonctions élémentairement transcendantes sur une courbe algébrique
This page was built for publication: Proving an execution of an algorithm correct?
