RUS
ENG
Full version
JOURNALS
// Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika
// Archive
Izv. Vyssh. Uchebn. Zaved. Mat.,
1998
Number 8,
Pages
56–59
(Mi ivm492)
The completeness problem in the class of polynomials is decidable
V. D. Solov'ev
Kazan State University
UDC:
519.716
Received:
29.12.1995
Fulltext:
PDF file (126 kB)
References
English version:
Russian Mathematics (Izvestiya VUZ. Matematika), 1998,
42
:8,
53–56
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2026
Fulltext:
PDF file (126 kB)