Pages that link to "Item:Q1405793"
From MaRDI portal
The following pages link to The power of nondeterminism and randomness for oblivious branching programs (Q1405793):
Displaying 16 items.
- Width hierarchy for \(k\)-OBDD of small width (Q748240) (← links)
- Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance (Q844146) (← links)
- Efficient oblivious branching programs for threshold and mod functions (Q1384527) (← links)
- On multi-partition communication complexity (Q1886038) (← links)
- Very narrow quantum OBDDs and width hierarchies for classical OBDDs (Q2361670) (← links)
- On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs (Q2361671) (← links)
- Nondeterministic unitary OBDDs (Q2399370) (← links)
- Reordering method and hierarchies for quantum and classical ordered binary decision diagrams (Q2399372) (← links)
- On derandomizing Yao's weak-to-strong OWF construction (Q2697871) (← links)
- (Q3723678) (← links)
- (Q3974873) (← links)
- Pseudorandom Bits for Oblivious Branching Programs (Q5053059) (← links)
- Worst Case Branching and Other Measures of Nondeterminism (Q5268392) (← links)
- DETERMINISM VS. NONDETERMINISM FOR TWO-WAY AUTOMATA: Representing the Meaning of States by Logical Formulæ (Q5495414) (← links)
- On the size of randomized OBDDs and read-once branching programs for \(k\)-stable functions (Q5957726) (← links)
- Classical and Quantum Computations with Restricted Memory (Q6163622) (← links)
