F(Z,1 ,Z2 ) plus A(Z1 ,Z2 )G(Z1 ,Z2 ) equals H(Z1 ,Z2 )..

被引：0

作者：

Lai, Yhean-Sen ^{[1
]}

机构：

[1] MIT Development Corp, Stanford, CT,, USA, MIT Development Corp, Stanford, CT, USA

来源：

IEEE transactions on circuits and systems | 1986年 / CAS-33卷 / 05期

关键词：

MATHEMATICAL TECHNIQUES - Polynomials;

D O I：

10.1109/TCS.1986.1085937

中图分类号：

学科分类号：

摘要：

An algorithm for finding the solution of the two-dimensional (2-D) Diophantine equation is proposed. The solution, when it exists, is not unique. However, the solution with minimal degrees is unique and can be achieved by this algorithm. An example is given to illustrate the procedure. The method is also applied to determine whether two polynomial functions are zero coprime. The computational results can be readily extended to three- or higher dimensional cases.

引用

页码：542 / 544