Skip to main content
SpringerLink
Log in

Criteria of Satisfiability for Homogeneous Systems of Linear Diophantine Constraints

  • Conference paper
  • First Online:
Book cover Parallel Processing and Applied Mathematics (PPAM 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2328))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Contenjean E., Devie H.: Solving systems of linear diophantine equations. In Proc. 3rd Workshop on Unification. Lambrecht (Germany, University of Kaiserslautern) June (1989)

    Google Scholar 

  2. Pottier L.: Minimal solutions of linear diophantine systems: bounds and algorithms. In Proc. of the Fourth Intern. Conf. on Rewriting Techniques and Applications. Como (Italy) (1991) 162–173

    Google Scholar 

  3. Domenjoud E.: Outils pour la deduction automatique dans les theories associatives-commutatives. Thesis de Doctorat d’Universite: Universite de Nancy I. (1991)

    Google Scholar 

  4. Clausen M., Fortenbacher A.: Efficient solution of linear diophantine equations. Journ. Symbolic Computation. Vol. 8. N 1,2 (1989) 201–216

    Article  MathSciNet  MATH  Google Scholar 

  5. Romeuf J. F.: A polinomial Algorithm for Solving systems of two linear Diophantine equations. TCS Vol. 74. N3 (1990) 329–340

    Article  MathSciNet  MATH  Google Scholar 

  6. Filgueiras M., Tomas A.P.: A Fast Method for Finding the Basis of Non-negative Solutions to a Linear Diophantine Equation. Journ. Symbolic Computation Vol. 19,2 (1995) 507–526

    Article  MathSciNet  MATH  Google Scholar 

  7. Allen R., Kennedy K.: Automatic translation of FORTRAN program to vector form. ACM Transactions on Programming Languages and systems, Vol. 9, N4 (1987) 491–542

    Article  MATH  Google Scholar 

  8. Krivoi S.L.: On some methods of solving and criteria of satisfiability for systems of linear Diophantine equations over set of natural numbers. Cybermetics and System Analysis. N 4 (1999) 12–36

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Computer Science, Technical University of Częstochowa, Dcabrowskiego 73, 42-200, Częstochowa, Poland

    Sergey Krivoi

Authors
  1. Sergey Krivoi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, Technical University of Czestochowa, Dabrowskiego 73, 42-200, Czestochowa, Poland

    Roman Wyrzykowski

  2. Computer Science Department, University of Tennessee, 122 Volunteer Blvd, Knoxville, TN, 37996-3450, USA

    Jack Dongarra

  3. Computer Science Department, Oklahoma State University, 700 N. Greenwood Ave., Tulsa, OK, 74106, USA

    Marcin Paprzycki

  4. DTU, UNI-C, Danish Computing Centre for Research and Education, Bldg. 304, 2800, Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krivoi, S. (2002). Criteria of Satisfiability for Homogeneous Systems of Linear Diophantine Constraints. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-48086-2_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43792-5

  • Online ISBN: 978-3-540-48086-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation