✦ LIBER ✦

A polynomial algorithm for solving systems of two linear diophantine equations

✍ Scribed by Jean-François Romeuf

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 987 KB
Volume: 74
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(90)90082-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An error-free algorithm to solve a linea

An error-free algorithm to solve a linear system of polynomial equations

✍ M. Morháč 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 522 KB

A Polynomial Time Algorithm for Diophant

A Polynomial Time Algorithm for Diophantine Equations in One Variable

✍ F CUCKER; P KOIRAN; S SMALE 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 195 KB

We exhibit an algorithm computing, for a polynomial f ∈ Z [t], the set of its integer roots. The running time of the algorithm is polynomial in the size of the sparse encoding of f .

A fast algorithm for solving systems of

A fast algorithm for solving systems of linear equations with two variables per equation

✍ Bengt Aspvall; Yossi Shiloach 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 531 KB

A Monte Carlo algorithm for solving syst

A Monte Carlo algorithm for solving systems of non-linear equations

✍ Aleksander Jablonski 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 349 KB

A projection algorithm for solving syste

A projection algorithm for solving systems of linear algebraic equations of high dimensionality

✍ G.P. Vasil'chenko; A.A. Svetlakov 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 562 KB

An iterative algorithm for solving syste

An iterative algorithm for solving systems of linear equations with a rectangular matrix

✍ Yu.P. Shvartsman 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 240 KB