Functions computable by Boolean circuits of logarithmic depth and branching programs of a special type

dc.contributor.author	Vasiliev A.
dc.date.accessioned	2018-09-18T20:33:28Z
dc.date.available	2018-09-18T20:33:28Z
dc.date.issued	2008
dc.identifier.issn	1990-4789
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/141122
dc.description.abstract	D. M. Barrington proved the coincidence of the class NC1 of functions computable by the circuits of logarithmic depth with the class of functions computable by branching programs of constant width and polynomial length (BWBP). In this paper, the structure of branching programs suggested by the Barrington method is defined more exactly. Namely, it is proved that we can compute all functions from NC1 and only them by the k-OBDDs of polynomial size and width 5. This can be reformulated as poly(n)-OBDD5 = NC1. © MAIK Nauka 2008.
dc.relation.ispartofseries	Journal of Applied and Industrial Mathematics
dc.title	Functions computable by Boolean circuits of logarithmic depth and branching programs of a special type
dc.type	Article
dc.relation.ispartofseries-issue	4
dc.relation.ispartofseries-volume	2
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	585
dc.source.id	SCOPUS19904789-2008-2-4-SID57549111000

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

Размер: 43.69Kb

Формат: PDF

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