Width hierarchy for k-OBDD of small width

dc.contributor.author	Khadiev K.
dc.date.accessioned	2018-09-18T20:34:50Z
dc.date.available	2018-09-18T20:34:50Z
dc.date.issued	2015
dc.identifier.issn	1995-0802
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/141347
dc.description.abstract	© 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 sufficient condition of Boolean function’s non representation as k-OBDD and complexity properties of Boolean function SAF. This function is modification of known Pointer Jumping (PJ) and Indirect Storage Access (ISA) functions.
dc.relation.ispartofseries	Lobachevskii Journal of Mathematics
dc.subject	Binary decision diagrams
dc.subject	Branching programs
dc.subject	complexity classes
dc.subject	k-OBDD
dc.subject	OBDD
dc.title	Width hierarchy for k-OBDD of small width
dc.type	Article
dc.relation.ispartofseries-issue	2
dc.relation.ispartofseries-volume	36
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	178
dc.source.id	SCOPUS19950802-2015-36-2-SID84935002758

Файлы в этом документе

Размер: 44.05Kb

Формат: PDF

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