scientific article; zbMATH DE number 1283999
From MaRDI portal
Publication:4240341
zbMATH Open0922.68063MaRDI QIDQ4240341FDOQ4240341
Authors: Marek Karpinski 
Publication date: 3 May 1999
Full work available at URL: http://www.eccc.uni-trier.de/eccc/info/call.html
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 2102760
- On the complexity of randomized read-once branching programs
- scientific article; zbMATH DE number 1962823
- Randomization and nondeterminism are comparable for ordered read-once branching programs
- On the size of randomized OBDDs and read-once branching programs for \(k\)-stable functions
Cited In (13)
- Title not available (Why is that?)
- Polynomial size \(\Omega\)-branching programs and their computational power
- Title not available (Why is that?)
- Fractional pebbling and thrifty branching programs
- Title not available (Why is that?)
- On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width
- On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs
- On the complexity of randomized read-once branching programs
- Title not available (Why is that?)
- The power of nondeterminism and randomness for oblivious branching programs
- Randomization and nondeterminism are comparable for ordered read-once branching programs
- On BPP versus \(NP\cup coNP\) for ordered read-once branching programs
- On the size of randomized OBDDs and read-once branching programs for \(k\)-stable functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4240341)
