Article

On the Power of Randomized Branching Programs

• Marek Karpinski
Electronic Colloquium on Computational Complexity (ECCC) 01/1995; 2.
Source: CiteSeer

ABSTRACT We define the notion of a randomized branching program in the natural way similar to the definition of a randomized circuit. We exhibit an explicit function fn for which we prove that: 1) f n can be computed by polynomial size randomized read-once ordered branching program with a small one-sided error; 2) fn cannot be computed in polynomial size by deterministic readonce branching programs; 3) fn cannot be computed in polynomial size by deterministic read- k-times ordered branching program for k = o(n= log n) (the required deterministic size is exp GammaOmega Gamma n k DeltaDelta ). 1 Preliminaries Different models of branching programs introduced in [13, 15], have been studied extensively in the last decade (see for example [19]). A survey of known lower bounds for different models of branching programs can be found in [17]. Developments in the field of digital design and verification have led to the introduction of restricted forms of branching programs. In parti...

0 Bookmarks
·
52 Views
• Source
Article: On BPP versus NP (semi-circle up) coNP for ordered read-once branching programs
[Hide abstract]
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 (semi-circle up) coNP) in the context of OBDDs; (2) Rn : {0,1}n → {0,1} belongs to PP \ (BPP(semi-circle up) NP (semi-circle up) coNP) in the context of OBDDs. Both of these functions are not in AC0.
Theoretical Computer Science 08/2001; 264(1):127-137. · 0.49 Impact Factor