The following pages link to (Q4234058):
Displayed 8 items.
- A simple function that requires exponential size read-once branching programs (Q287023) (← links)
- Approximating Boolean functions by OBDDs (Q867861) (← 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)
- Bounds on the OBDD-size of integer multiplication via universal hashing (Q2575837) (← links)
- A very simple function that requires exponential size read-once branching programs. (Q2583538) (← links)
- Randomization and nondeterminism are comparable for ordered read-once branching programs (Q4571952) (← links)
- On BPP versus \(NP\cup coNP\) for ordered read-once branching programs (Q5941564) (← links)