The following pages link to (Q3821583):
Displaying 8 items.
- A simple function that requires exponential size read-once branching programs (Q287023) (← links)
- Worst case examples for operations on OBDDs (Q294746) (← links)
- On the size of binary decision diagrams representing Boolean functions (Q673087) (← links)
- On oblivious branching programs of linear length (Q804285) (← links)
- Neither reading few bits twice nor reading illegally helps much (Q1130185) (← links)
- Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\) (Q1178711) (← links)
- A very simple function that requires exponential size read-once branching programs. (Q2583538) (← links)
- Lower bounds on the complexity of real-time branching programs (Q3815526) (← links)
