Pages that link to "Item:Q804285"
From MaRDI portal
The following pages link to On oblivious branching programs of linear length (Q804285):
Displaying 7 items.
- Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance (Q844146) (← links)
- On approximation by \(^{\oplus}\)-OBDDs (Q845954) (← links)
- Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs (Q1275068) (← links)
- On relations between counting communication complexity classes (Q1880784) (← links)
- On the parallel complexity of linear groups (Q3988804) (← links)
- Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines (Q4020492) (← links)
- On the descriptive and algorithmic power of parity ordered binary decision diagrams (Q5047172) (← links)
