Kazan Federal University Digital Repository

Extension of the hierarchy for k-OBDDs of small width

Show simple item record

dc.contributor.author Ablayev F.
dc.contributor.author Khadiev K.
dc.date.accessioned 2018-09-18T20:17:07Z
dc.date.available 2018-09-18T20:17:07Z
dc.date.issued 2013
dc.identifier.issn 1066-369X
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/138297
dc.description.abstract 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 allows us to extend the hierarchy proved by Bolling-Sauerhoff-Sieling-Wegener in 1996 for k-OBDDs. Moreover, using the PJM function (a modification of well-known PJ and ISA functions), we prove a new hierarchy. © 2013 Allerton Press, Inc.
dc.relation.ispartofseries Russian Mathematics
dc.subject binary decision diagrams
dc.subject communication complexity
dc.subject communication protocol
dc.subject k-OBDD
dc.subject Keywords and phrases: branching programs
dc.subject OBDD
dc.title Extension of the hierarchy for k-OBDDs of small width
dc.type Article
dc.relation.ispartofseries-issue 3
dc.relation.ispartofseries-volume 57
dc.collection Публикации сотрудников КФУ
dc.relation.startpage 46
dc.source.id SCOPUS1066369X-2013-57-3-SID84876240954


Files in this item

This item appears in the following Collection(s)

  • Публикации сотрудников КФУ Scopus [24551]
    Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics