Nondeterministic unitary OBDDs

dc.contributor.author	Gainutdinova A.
dc.contributor.author	Yakaryılmaz A.
dc.date.accessioned	2018-09-19T20:29:52Z
dc.date.available	2018-09-19T20:29:52Z
dc.date.issued	2017
dc.identifier.issn	0302-9743
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/142963
dc.description.abstract	© Springer International Publishing AG 2017.We investigate the width complexity of nondeterministic uni-tary OBDDs (NUOBDDs). Firstly, we present a generic lower bound on their widths based on the size of strong 1-fooling sets. Then, we present classically "cheap" functions that are "expensive" for NUOBDDs and vice versa by improving the previous gap. We also present a function for which neither classical nor unitary nondeterminism does help. More-over, based on our results, we present a width hierarchy for NUOBDDs. Lastly, we provide the bounds on the widths of NUOBDDs for the basic Boolean operations negation, union, and intersection.
dc.relation.ispartofseries	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.title	Nondeterministic unitary OBDDs
dc.type	Conference Paper
dc.relation.ispartofseries-volume	10304 LNCS
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	126
dc.source.id	SCOPUS03029743-2017-10304-SID85019231690

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

Имя: SCOPUS03029743-20 ...

Размер: 48.39Kb

Формат: PDF

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