Pages that link to "Item:Q4571952"
From MaRDI portal
The following pages link to Randomization and nondeterminism are comparable for ordered read-once branching programs (Q4571952):
Displayed 11 items.
- Approximation of boolean functions by combinatorial rectangles (Q1399979) (← links)
- Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (Q1401957) (← links)
- A lower bound for integer multiplication on randomized ordered read-once branching programs. (Q1426006) (← links)
- A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs (Q1575258) (← links)
- Randomized OBDDs for the most significant bit of multiplication need exponential space (Q1944061) (← links)
- On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs (Q2361671) (← links)
- Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size (Q3075511) (← links)
- On the Complexity of the Hidden Weighted Bit Function for Various BDD Models (Q4265532) (← links)
- (Q5228561) (← links)
- On BPP versus \(NP\cup coNP\) for ordered read-once branching programs (Q5941564) (← links)
- Error-Free Affine, Unitary, and Probabilistic OBDDs (Q6169903) (← links)