Skip to main content
SpringerLink
Log in

Complexity of the problem of approximation of stochastic matrix by rational elements

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 278))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berge C.— Theorie des graphes et ses applications. Paris. 1958.

    Google Scholar 

  2. Fredrecksen H.A.— Class of nonlinea der Bruijn Cycles. J. Comb. Theory, 1975, Vol. 19-A, p. 192–199.

    Google Scholar 

  3. Баранов Г.Г., Захаров В.М., Кузнецов С.Е. Синтез циклических многозначных последовательностей с заданной структурой. Тез.доклад. конф. "Вероятностные автоматы и их приложения". Тбилиси, "Мецниереба", 1986, с. 24.

    Google Scholar 

  4. Бухараев Р.Г. Основы теории вероятностных автоматов. М.: "Наука", 1985, с. 26–28.

    Google Scholar 

  5. Поспелов Д.А. Вероятностные автоматы. М.: "Энергия", 1970, с. 21–26.

    Google Scholar 

  6. Бурков В.Н., Горидзе И.А., Ловецкий С.Е. Прикладные задачи теории графов. ВЦ АН ГССР, Тбилиси, с. 76–80.

    Google Scholar 

  7. Marshall A.W., Olkin I.— Inequalities: Theory of majorization and its applications. Academic press, 1979, "Math. in Science and Engineering", V. 143.

    Google Scholar 

  8. Papadimitrion C.H., Steiglitz K.— Combinatorial optimization. Algorithms and complexity. Prentice-Hall. Inc., Engewood Cliffs, New Jersey, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of cibernetic, NIIMM, Kazan State University, 420008, Kazan, USSR

    V. M. Zacharov & S. E. Kuznetsov

Authors
  1. V. M. Zacharov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. E. Kuznetsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach Rais Gatič Bukharajev Oleg Borisovič Lupanov

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zacharov, V.M., Kuznetsov, S.E. (1987). Complexity of the problem of approximation of stochastic matrix by rational elements. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_106

Download citation

  • DOI: https://doi.org/10.1007/3-540-18740-5_106

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18740-0

  • Online ISBN: 978-3-540-48138-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation