The following pages link to (Q4536401):
Displaying 8 items.
- The power of nondeterminism in polynomial-size bounded-width branching programs (Q1116338) (← links)
- On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs (Q2361671) (← links)
- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication (Q2508966) (← links)
- Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication (Q2771493) (← links)
- A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 (Q2891385) (← links)
- Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs (Q4462678) (← links)
- (Q4471998) (← links)
- (Q4542589) (← links)
