Kazanskii Gosudarstvennyi Universitet. Uchenye Zapiski. Seriya Fiziko-Matematichaskie Nauki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki:
Year:
Volume:
Issue:
Page:
Find




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

Kazanskii Gosudarstvennyi Universitet. Uchenye Zapiski. Seriya Fiziko-Matematichaskie Nauki, 2009, Volume 151, Book 2, Pages 107–113 (Mi uzku751)  
The XV International Conference "Problems of Theoretical Cybernetics"

On the Complexity of Randomized Read-once Branching Programs

R. G. Mubarakzjanov

Kazan State University
Full-text PDF (210 kB)
References:
PDF
HTML
Abstract: Ordered binary decision diagrams are a well known computational model. Graph-driven read-once branching programs presented in this paper generalize this model. Exponential lower bound of the complexity of such programs for integer multiplication is proven.
Keywords: Boolean function, binary branching program, complexity class, computation complexity lower bound.
Received: 16.03.2009
Document Type: Article
UDC: 519.714
Language: Russian
Citation: R. G. Mubarakzjanov, “On the Complexity of Randomized Read-once Branching Programs”, Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151, no. 2, Kazan University, Kazan, 2009, 107–113
Citation in format AMSBIB
\Bibitem{Mub09}
\by R.~G.~Mubarakzjanov
\paper On the Complexity of Randomized Read-once Branching Programs
\serial Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki
\yr 2009
\vol 151
\issue 2
\pages 107--113
\publ Kazan University
\publaddr Kazan
\mathnet{http://mi.mathnet.ru/uzku751}
Linking options:
  • https://www.mathnet.ru/eng/uzku751
  • https://www.mathnet.ru/eng/uzku/v151/i2/p107
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki
    Statistics & downloads:
    Abstract page:295
    Full-text PDF :122
    References:36
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024