Algorithms for computer algebra
Algorithms for computer algebra
Evaluation of the heuristic polynomial GCD
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Subresultants and Reduced Polynomial Remainder Sequences
Journal of the ACM (JACM)
On Euclid's Algorithm and the Theory of Subresultants
Journal of the ACM (JACM)
Fundamental problems of algorithmic algebra
Fundamental problems of algorithmic algebra
A compiled implementation of strong reduction
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
A Skeptic’s Approach to Combining HOL and Maple
Journal of Automated Reasoning
A Machine-Checked Implementation of Buchberger's Algorithm
Journal of Automated Reasoning
Theoretical Computer Science - Latin American theoretical informatics
Journal of Functional Programming
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A semi-reflexive tactic for (sub-)equational reasoning
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
Implementing the cylindrical algebraic decomposition within the Coq system
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
We describe here a formal proof in the Coq system of the structure theorem for subresultants, which allows to prove formally the correctness of our implementation of the subresultants algorithm. Up to our knowledge it is the first mechanized proof of this result.