Article citationsMore>>

L. Pottier, “Minimal solutions of linear diophantine systems: bounds and algorithms,” Proceedings of the Fourth Intern. Conference on Rewriting Technique and Application, Como, Italy, pp. 162–173, 1991.

has been cited by the following article:

• TITLE: Solving Linear Systems via Composition of their Clans

  AUTHORS: Dmitry A. ZAITSEV

  KEYWORDS: linear system, decomposition, clans, acceleration of computation

  JOURNAL NAME: Intelligent Information Management, Vol.1 No.2, November 30, 2009

  ABSTRACT: The decomposition technique for linear system solution is proposed. This technique may be combined with any known method of linear system solution. An essential acceleration of computations is obtained. Methods of linear system solution depend on the set of numbers used. For integer and especially for natural numbers all the known methods are hard enough. In this case the decomposition technique described allows the exponential acceleration of computations.