Sciweavers

188 search results - page 1 / 38
» An Algorithm for Solving Systems of Linear Diophantine Equat...
Sort
View
EPIA
1997
Springer
13 years 9 months ago
An Algorithm for Solving Systems of Linear Diophantine Equations in Naturals
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 ...
Ana Paula Tomás, Miguel Filgueiras
EPIA
1993
Springer
13 years 9 months ago
Fast Methods for Solving Linear Diophantine Equations
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...
Miguel Filgueiras, Ana Paula Tomás
RTA
1997
Springer
13 years 9 months ago
Solving Linear Diophantine Equations Using the Geometric Structure of the Solution Space
In the development of algorithms for finding the minimal solutions of systems of linear Diophantine equations, little use has been made (to our knowledge) of the results by Stanle...
Ana Paula Tomás, Miguel Filgueiras
AAECC
2001
Springer
121views Algorithms» more  AAECC 2001»
13 years 9 months ago
Algorithms for Large Integer Matrix Problems
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...
Mark Giesbrecht, Michael J. Jacobson Jr., Arne Sto...
FOCS
2002
IEEE
13 years 9 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich