On BPP versus NP ∪ coNP for ordered read-once branching programs

dc.contributor.author	Ablayev F.
dc.contributor.author	Karpinski M.
dc.contributor.author	Mubarakzjanov R.
dc.date.accessioned	2018-09-17T20:39:36Z
dc.date.available	2018-09-17T20:39:36Z
dc.date.issued	2001
dc.identifier.issn	0304-3975
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/133841
dc.description.abstract	We investigate the relationship between probabilistic and nondeterministic complexity classes PP, BPP, NP and coNP with respect to ordered read-once branching programs (OBDDs). We exhibit two explicit Boolean functions qn,Rn such that: (1) qn:{0, 1}n → {0, 1} belongs to BPP\(NP ∪ coNP) in the context of OBDDs; (2) Rn:{0, 1}n → {0, 1} belongs to PP\(BPP ∪ NP ∪ coNP) in the context of OBDDs. Both of these functions are not in AC0. © 2001 Elsevier Science B.V. All rights reserved.
dc.relation.ispartofseries	Theoretical Computer Science
dc.title	On BPP versus NP ∪ coNP for ordered read-once branching programs
dc.type	Article
dc.relation.ispartofseries-issue	1
dc.relation.ispartofseries-volume	264
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	127
dc.source.id	SCOPUS03043975-2001-264-1-SID0034894305

Files in this item

Size: 54.98Kb

Format: PDF

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