Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials (Q3613426): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Coq / rank | |||
Normal rank | |||
Revision as of 15:59, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials |
scientific article |
Statements
Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials (English)
0 references
12 March 2009
0 references
