Doklady Akademii Nauk SSSR
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


Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find




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

Doklady Akademii Nauk SSSR, 1986, Volume 288, Number 1, Pages 19–23 (Mi dan8609)  
This article is cited in 1 scientific paper (total in 1 paper)

MATHEMATICS

A decomposition algorithm for the unification problem and new polynomially solvable cases

B. I. Gol'dengorin

Kirov Kazakh State University, Alma-Ata
Full-text PDF (760 kB) Citations (1)
Presented: L. V. Kantorovich
Received: 02.12.1985
Bibliographic databases:
Document Type: Article
UDC: 519.8
Language: Russian
Citation: B. I. Gol'dengorin, “A decomposition algorithm for the unification problem and new polynomially solvable cases”, Dokl. Akad. Nauk SSSR, 288:1 (1986), 19–23
Citation in format AMSBIB
\Bibitem{Gol86}
\by B.~I.~Gol'dengorin
\paper A decomposition algorithm for the unification problem and new
polynomially solvable cases
\jour Dokl. Akad. Nauk SSSR
\yr 1986
\vol 288
\issue 1
\pages 19--23
\mathnet{http://mi.mathnet.ru/dan8609}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=841132}
\zmath{https://zbmath.org/?q=an:0636.65059}
Linking options:
  • https://www.mathnet.ru/eng/dan8609
  • https://www.mathnet.ru/eng/dan/v288/i1/p19
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024