The algorithm for completeness recognizing in function algebra L(ℤ)
Andrey I. Mamontov, Dmitry Germanovich Meshchaninov · Discrete Mathematics and Applications · 2014
The function algebra of first-degree polynomials over ring ℤ is analysed. The algorithm for completeness recognition in this algebra is described, its time and space complexity are estimated. The algorithm is applied to some other problems: recognition properties of polynomials and completeness of their special sets.