Criteria of Satisfiability for Homogeneous Systems of Linear Diophantine Constraints

Authors:
Sergey Krivoi
Affiliations:
-
Venue:
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Year:
2001

Citing 5
Cited 2

Automatic translation of FORTRAN programs to vector form

ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient solution of linear diophantine equations

Journal of Symbolic Computation
A polynomial algorithm for solving systems of two linear diophantine equations

Theoretical Computer Science
Minimal solutions of linear diophantine systems: bounds and algorithms

RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
A fast method for finding the basis of nonnegative solutions to a linear Diophantine equation

Journal of Symbolic Computation

Exploring the properties of MSC documents by translating them into Petri nets

Cybernetics and Systems Analysis
Automatic Modeling and Analysis of MSC-specified Systems

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an incremental algorithm for computing a minimal supported set of solutions for homogeneous systems of linear Diophantine equations (HSLDE) over the set of natural numbers N, which can also be applied to the homogeneous systems of linear Diophantine inequations (HSLDI) and mixed systems.