Pages that link to "Item:Q1173954"
From MaRDI portal
The following pages link to Lower bounds for depth-restricted branching programs (Q1173954):
Displaying 8 items.
- On the size of binary decision diagrams representing Boolean functions (Q673087) (← links)
- On oblivious branching programs of linear length (Q804285) (← links)
- Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance (Q844146) (← links)
- Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs (Q1275068) (← links)
- Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (Q1401957) (← links)
- The nonapproximability of OBDD minimization (Q1854498) (← links)
- On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs (Q1854567) (← links)
- On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth (Q2408558) (← links)
