Results 161 to 170 of about 3,886,089 (197)
Hardness of approximating the Minimum Solutions of Linear Diophantine Equations [PDF]
Theoretical Computer Science, 2007 Let 1≤p0 where n is the number of variables in the ...
Chen, Wenbin, Meng, Jiangtao
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2020
A study of linear Diophantine equations, with a focus on the Frobenius number and the denumerants.
openaire +1 more source
A study of linear Diophantine equations, with a focus on the Frobenius number and the denumerants.
openaire +1 more source
Mathematics Magazine, 1958
We shall describe elementary methods for solving linear Diophantine equations, either single equations or systems of equations. The equations with which we shall deal have integral coefficients and require integral solutions. Such equations are named after Diophantus of Alexandria, who lived probably between 100 and 300 A. D.
openaire +1 more source
We shall describe elementary methods for solving linear Diophantine equations, either single equations or systems of equations. The equations with which we shall deal have integral coefficients and require integral solutions. Such equations are named after Diophantus of Alexandria, who lived probably between 100 and 300 A. D.
openaire +1 more source
On solving probabilistic linear Diophantine equations
J. Mach. Learn. Res., 2021Summary: Multiple methods exist for computing marginals involving a linear Diophantine constraint on random variables. Each of these extant methods has some limitation on the dimension and support or on the type of marginal computed (e.g., sum-product inference, max-product inference, maximum a posteriori, etc.).
Patrick Kreitzberg, Oliver Serang
openaire +2 more sources
The Linear Diophantine Equation
The American Mathematical Monthly, 1981(1981). The Linear Diophantine Equation. The American Mathematical Monthly: Vol. 88, No. 3, pp. 200-203.
openaire +1 more source
1988
A linear diophantine equation has the form $$ {a_1}{x_1} + {a_2}{x_2} + ... + {a_n}{x_n} = c $$ where a1, a2,..., an, c are integer constants and x1, x2,..., xn are integer variables. As we saw in Chapter 3, these equations play a very important role in the linear dependence problem.
openaire +1 more source
A linear diophantine equation has the form $$ {a_1}{x_1} + {a_2}{x_2} + ... + {a_n}{x_n} = c $$ where a1, a2,..., an, c are integer constants and x1, x2,..., xn are integer variables. As we saw in Chapter 3, these equations play a very important role in the linear dependence problem.
openaire +1 more source
A Diophantine Equation Concerning Linear Recurrences
Periodica Mathematica Hungarica, 1997Let \(G_n ^{(1)}, \ldots, G_n ^{(\nu)}\) and \(H_n^{(1)}, \ldots, H_n ^{(\mu)}\) \((n=0, 1, 2,\ldots)\) be linear recurrence sequences of rational integers with order at least two. For fixed primes \(p_1 , \ldots , p_t \), let \(S\) be the set of integers of the form \(\pm p_1 ^{e_1 } \cdots p_t ^{e_t }\) \((e_i \geq 0)\). The author proves, under some
openaire +2 more sources
2015
“I had a very strange dream last night,” Tweedledum said to Tweedledee. “I dreamt that we were not twins but quintuplets.” “What were the names of the others?” asked Tweedledee. “One of them was called Tweedledoo. I don't remember the other two, but they were also Tweedle-something. We had done something that was only possible in a dream. We made the
openaire +1 more source
“I had a very strange dream last night,” Tweedledum said to Tweedledee. “I dreamt that we were not twins but quintuplets.” “What were the names of the others?” asked Tweedledee. “One of them was called Tweedledoo. I don't remember the other two, but they were also Tweedle-something. We had done something that was only possible in a dream. We made the
openaire +1 more source
A Note on the Linear Diophantine Equation
The American Mathematical Monthly, 1941(1941). A Note on the Linear Diophantine Equation. The American Mathematical Monthly: Vol. 48, No. 10, pp. 662-666.
openaire +2 more sources
Solution of Systems of Linear Diophantine Equations
2001Two new methods to solve linear systems of Diophantine equations are proposed - modular (CRT) and p-adic (Hensel). Each of them allows to obtain solutions of a system with the size n x m with the complexity O(nsm). For quasi-square systems, the p-adic method allows to obtain solution with the complexity O(n 3), and the modular method with complexity O ...
openaire +2 more sources