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.
CITATION STYLE
Ablayev, F. (1997). Randomization and nondeterminism are comparable for ordered read-onee branching programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1256, pp. 196–202). Springer Verlag. https://doi.org/10.1007/3-540-63165-8_177
Mendeley helps you to discover research relevant for your work.