Home
→
Browsing by Subject

Browsing by Subject "OBDD"

Now showing items 1-11 of 11

Extension of the hierarchy for k-OBDDs of small width

Ablayev F.; Khadiev K. (2013)

In this paper we explore the well-known k-OBDD model of branching programs. We develop a method of representation of the k-OBDD computation process as an "automata-communication protocol" computation process. Our method ...
Lower bounds and hierarchies for quantum memoryless communication protocols and quantum ordered binary decision diagrams with repeated test

Unknown author (2018)

© 2018, Springer International Publishing AG. We explore multi-round quantum memoryless communication protocols. These are restricted version of multi-round quantum communication protocols. The “memoryless” term means that ...
On computational power of classical and quantum Branching programs

Ablayev F. (2006)

We present a classical stochastic simulation technique of quantum Branching programs. This technique allows to prove the following relations among complexity classes: PrQP-BP ⊆ PP-BP and BQP-BP ⊆ PP-BP. Here BPP-BP and ...
On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-k-times branching programs

Khadiev K. (2016)

© 2016, Pleiades Publishing, Ltd.The paper examines hierarchies for nondeterministic and deterministic ordered read-ktimes Branching programs. The currently known hierarchies for deterministic k-OBDD models of Branching ...
Quantum Online Streaming Algorithms with Logarithmic Memory

Khadiev K.; Khadieva A. (2019)

© 2019, Springer Science+Business Media, LLC, part of Springer Nature. We consider quantum and classical (deterministic or randomize) streaming online algorithms with respect to competitive ratio. We show that there is a ...
Reordering method and hierarchies for quantum and classical ordered binary decision diagrams

Khadiev K.; Khadieva A. (2017)

© Springer International Publishing AG 2017.We consider Quantum OBDD model. It is restricted version of read-once Quantum Branching Programs, with respect to “width” complexity. It is known that maximal complexity gap ...
Two-way quantum and classical machines with small memory for online minimization problems

Khadiev K.; Khadieva A. (2019)

© 2019 SPIE. We consider online algorithms. Typically the model is investigated with respect to competitive ratio. In this paper, we explore algorithms with small memory. We investigate two-way automata as a model for ...
Very narrow quantum OBDDs and width hierarchies for classical OBDDs

Ablayev F.; Gainutdinova A.; Khadiev K.; Yakaryılmaz A. (2016)

© 2016, Pleiades Publishing, Ltd.In the paper we investigate Ordered Binary Decision Diagrams (OBDDs)–a model for computing Boolean functions. We present a series of results on the comparative complexity for several variants ...
Width hierarchy for k-OBDD of small width

Khadiev K. (2015)

© 2015, Pleiades Publishing, Ltd. In this paper was explored well known model k-OBDD. There are proven width based hierarchy of classes of boolean functions which computed by k-OBDD. The proof of hierarchy is based on ...
Методическое пособие по предмету "Алгоритмы и структуры данных в построении и анализе СБИС"

Мубаракзянов, Р. Г.; Абрамский, М. М. (Казанский университет, 2015)

Пособие предназначено для студентов, изучающих программную дисциплину "Алгоритмы и структуры данных в построении и анализе СБИС", а также для преподавателей, ведущих занятия по данному курсу.
Сложность проблемы "Выполнимость" для бинарных программ

Мубаракзянов Рустам Гамирович (2017)

В работе исследуется сожность проверки выполнимости различных видов бинарных программ. Обобщая простейшую из них (OBDD), показано начиная с какого момента проблема становится NP-полной.

Now showing items 1-11 of 11

Search DSpace

Advanced Search

Browse

All of Kazan Federal University Digital Repository

Browsing by Subject "OBDD"

Browsing by Subject "OBDD"

Search DSpace

Browse

All of Kazan Federal University Digital Repository

My Account