59 search results - page 4 / 12 » Uniqueness of integer solution of linear equations |
ADCM
1998
14 years 9 months ago
1998
Two e cient methods for solving generalized Lyapunov equations and their implementations in FORTRAN 77 are presented. The rst one is a generalization of the Bartels{Stewart method...
103
click to vote
FMCAD
2006
Springer
15 years 1 months ago
2006
Springer
Ario is a solver for systems of linear integer arithmetic logic. Such systems are commonly used in design verification applications and are classified under Satisfiability Modulo T...
ASIACRYPT
2008
Springer
14 years 11 months ago
2008
Springer
We study the problem of finding solutions to linear equations modulo an unknown divisor p of a known composite integer N. An important application of this problem is factorization ...
MOC
1998
14 years 9 months ago
1998
If a, b and n are positive integers with b ≥ a and n ≥ 3, then the equation of the title possesses at most one solution in positive integers x and y, with the possible exceptio...
FCT
1993
Springer
15 years 1 months ago
1993
Springer
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...