Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Izv. Vyssh. Uchebn. Zaved. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 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
Full-text PDF (126 kB)
References:
PDF
HTML
Received: 29.12.1995
Bibliographic databases:
UDC: 519.716
Language: Russian
Citation: V. D. Solov'ev, “The completeness problem in the class of polynomials is decidable”, Izv. Vyssh. Uchebn. Zaved. Mat., 1998, no. 8, 56–59; Russian Math. (Iz. VUZ), 42:8 (1998), 53–56
Citation in format AMSBIB
\Bibitem{Sol98}
\by V.~D.~Solov'ev
\paper The completeness problem in the class of polynomials is decidable
\jour Izv. Vyssh. Uchebn. Zaved. Mat.
\yr 1998
\issue 8
\pages 56--59
\mathnet{http://mi.mathnet.ru/ivm492}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1657390}
\zmath{https://zbmath.org/?q=an:1115.03305}
\transl
\jour Russian Math. (Iz. VUZ)
\yr 1998
\vol 42
\issue 8
\pages 53--56
Linking options:
  • https://www.mathnet.ru/eng/ivm492
  • https://www.mathnet.ru/eng/ivm/y1998/i8/p56
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Известия высших учебных заведений. Математика Russian Mathematics (Izvestiya VUZ. Matematika)
    Statistics & downloads:
    Abstract page:191
    Full-text PDF :57
    References:44
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024