Kazan Federal University Digital Repository

Randomization and nondeterminism are comparable for ordered read-onee branching programs

Show simple item record

dc.contributor.author Ablayev F.
dc.date.accessioned 2018-09-17T20:39:04Z
dc.date.available 2018-09-17T20:39:04Z
dc.date.issued 1997
dc.identifier.issn 0302-9743
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/133826
dc.description.abstract © Springer-Verlag Berlin Heidelberg 1997. In [3] we exhibited a simple boolean functions fn in n variables such that: fn can be computed by polynomial size randomized ordered read-once branching program with one sided small error; any nondeterministic ordered read-once branching program that computes fn has exponential size. In this paper we present a simple boolean function gn in n variables such that: gn can be computed by polynomial size nondeterministic ordered read-once branching program; any two-sided error randomized ordered read-once branching program that computes fn has exponential size.These mean that BPP and NP are incomparable in the context of ordered read-once branching program.
dc.relation.ispartofseries Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.title Randomization and nondeterminism are comparable for ordered read-onee branching programs
dc.type Conference Paper
dc.relation.ispartofseries-volume 1256
dc.collection Публикации сотрудников КФУ
dc.relation.startpage 196
dc.source.id SCOPUS03029743-1997-1256-SID84951156230


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