|
Fundamentalnaya i Prikladnaya Matematika, 1999, Volume 5, Issue 3, Pages 931–935
(Mi fpm403)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Short communications
On the algorithmic decidability of property of expressibility for polynomials
V. Sh. Darsalia M. V. Lomonosov Moscow State University
Abstract:
The problem of the algorithmic decidabilty of property of expressibility for functional systems of polynomials with natural, integer and rational coefficients is solved.
Received: 01.04.1996
Citation:
V. Sh. Darsalia, “On the algorithmic decidability of property of expressibility for polynomials”, Fundam. Prikl. Mat., 5:3 (1999), 931–935
Linking options:
https://www.mathnet.ru/eng/fpm403 https://www.mathnet.ru/eng/fpm/v5/i3/p931
|
|