The following pages link to (Q4708564):
Displayed 3 items.
- A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (Q1007589) (← links)
- Lower bounds for restricted read-once parity branching programs (Q2503280) (← links)
- Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs (Q4462678) (← links)