Abstract
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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
APA
Mahboubi, A. (2006). Proving formally the implementation of an efficient gcd algorithm for polynomials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4130 LNAI, pp. 438–452). Springer Verlag. https://doi.org/10.1007/11814771_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free