417 search results - page 1 / 84 » Fast Methods for Solving Linear Diophantine Equations |
EPIA
1993
Springer
13 years 9 months ago
1993
Springer
We present some recent results from our research on methods for finding the minimal solutions to linear Diophantine equations over the naturals. We give an overview of a family of...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
CSB
2005
IEEE
13 years 10 months ago
2005
IEEE
We have previously developed a method [1] for the inverse design of small ligands. This method can be used to design novel compounds with optimized properties (such as drugs) and ...
EPIA
1997
Springer
13 years 9 months ago
1997
Springer
Abstract. A new algorithm for finding the minimal solutions of systems of linear Diophantine equations has recently been published. In its description the emphasis was put on the ...
AAECC
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. New algorithms are described and analysed for solving various problems associated with a large integer matrix: computing the Hermite form, computing a kernel basis, and s...