13 search results - page 1 / 3 » A correct proof of the heuristic GCD algorithm |
CORR
2002
Springer
13 years 4 months ago
2002
Springer
CADE
2006
Springer
14 years 5 months ago
2006
Springer
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 subresulta...
ISSAC
2005
Springer
13 years 10 months ago
2005
Springer
Over the past few decades several variations on a “half GCD” algorithm for obtaining the pair of terms in the middle of a Euclidean sequence have been proposed. In the integer...
ANTS
2004
Springer
13 years 10 months ago
2004
Springer
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
INFORMATICALT
2010
13 years 3 months ago
2010
The DPLL procedure for the SAT problem is one of the fundamental algorithms in computer science, with many applications in a range of domains, including software and hardware veri...