A polynomial algorithm for solving systems of two linear diophantine equations (Q914391): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bounds on Positive Integral Solutions of Linear Diophantine Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient solution of linear diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational sets in commutative monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bound on Solutions of Linear Integer Equalities and Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Algol-Like Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4723808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4159542 / rank
 
Normal rank

Latest revision as of 16:45, 20 June 2024

scientific article
Language Label Description Also known as
English
A polynomial algorithm for solving systems of two linear diophantine equations
scientific article

    Statements

    A polynomial algorithm for solving systems of two linear diophantine equations (English)
    0 references
    1990
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    polynomial algorithm
    0 references
    linear diophantine systems
    0 references
    minimal length solution
    0 references