The following pages link to (Q3804193):
Displaying 6 items.
- On oblivious branching programs of linear length (Q804285) (← links)
- Polynomial size \(\Omega\)-branching programs and their computational power (Q918199) (← links)
- Problems complete for \(\oplus L\) (Q918696) (← links)
- Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access (Q4032302) (← links)
- A reducibility concept for problems defined in terms of ordered binary decision diagrams (Q5047173) (← links)
- (Q5121903) (← links)
