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, 1966, Number 6, Pages 95–98 (Mi ivm2776)  
This article is cited in 4 scientific papers (total in 4 papers)

Lower bounds for the complexity of probabilistic binary programs with a large ordered part

G. M. Mubarakzyanov

Kazan'
Full-text PDF (316 kB) Citations (4)
Received: 19.03.1966
Bibliographic databases:
UDC: 519.46
Language: Russian
Citation: G. M. Mubarakzyanov, “Lower bounds for the complexity of probabilistic binary programs with a large ordered part”, Izv. Vyssh. Uchebn. Zaved. Mat., 1966, no. 6, 95–98
Citation in format AMSBIB
\Bibitem{Mub66}
\by G.~M.~Mubarakzyanov
\paper Lower bounds for the complexity of probabilistic binary programs with a~large ordered part
\jour Izv. Vyssh. Uchebn. Zaved. Mat.
\yr 1966
\issue 6
\pages 95--98
\mathnet{http://mi.mathnet.ru/ivm2776}
\zmath{https://zbmath.org/?q=an:0204.04103}
Linking options:
  • https://www.mathnet.ru/eng/ivm2776
  • https://www.mathnet.ru/eng/ivm/y1966/i6/p95
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Известия высших учебных заведений. Математика Russian Mathematics (Izvestiya VUZ. Matematika)
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024