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, 2005, Number 11, Pages 34–43 (Mi ivm103)  
The capabilities of probabilistic ordered read-$k$-times binary programs and deterministic read-once binary programs are incomparable

R. G. Mubarakzyanov

Kazan State University
Full-text PDF (237 kB)
References:
PDF
HTML
Received: 27.12.2004
Bibliographic databases:
UDC: 519.714
Language: Russian
Citation: R. G. Mubarakzyanov, “The capabilities of probabilistic ordered read-$k$-times binary programs and deterministic read-once binary programs are incomparable”, Izv. Vyssh. Uchebn. Zaved. Mat., 2005, no. 11, 34–43; Russian Math. (Iz. VUZ), 49:11 (2005), 32–40
Citation in format AMSBIB
\Bibitem{Mub05}
\by R.~G.~Mubarakzyanov
\paper The capabilities of probabilistic ordered read-$k$-times binary programs and deterministic read-once binary programs are incomparable
\jour Izv. Vyssh. Uchebn. Zaved. Mat.
\yr 2005
\issue 11
\pages 34--43
\mathnet{http://mi.mathnet.ru/ivm103}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2228053}
\transl
\jour Russian Math. (Iz. VUZ)
\yr 2005
\vol 49
\issue 11
\pages 32--40
Linking options:
  • https://www.mathnet.ru/eng/ivm103
  • https://www.mathnet.ru/eng/ivm/y2005/i11/p34
    • 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:141
    Full-text PDF :41
    References:42
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024