ITHEA International Scientific Society : SYSTEMS OF LINEAR DIOPHANTINE EQUATIONS AND DIS-EQUATIONS COMPLEXITY

ITHEA Classification Structure > F. Theory of Computation > F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY > F.2.m Miscellaneous

SYSTEMS OF LINEAR DIOPHANTINE EQUATIONS AND DIS-EQUATIONS COMPLEXITY
By: Nikolay K. Kosovskii, Nikolay N. Kosovskii (3119 reads)

Rating:

(1.00/10)

Abstract: Series of problems concerning systems of linear Diophantine equations and dis-equations with explicitly given parameters are offered below. For every problem from a series the conditions upon the parameters under which the problem is NP-complete are proved.

Keywords: NP-completeness, system of linear Diophantine equations, system of linear Diophantine dis-equations

ACM Classification Keywords: F.2.m Analysis of Algorithms and Problem Complexity Miscellaneous

Link:

SYSTEMS OF LINEAR DIOPHANTINE EQUATIONS AND DIS-EQUATIONS COMPLEXITY

Nikolay K. Kosovskii, Nikolay N. Kosovskii

http://www.foibg.com/ijita/vol22/ijita22-03-p04.pdf