Pages that link to "Item:Q1275068"
From MaRDI portal
The following pages link to Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs (Q1275068):
Displaying 13 items.
- Extension of the hierarchy for \(k\)-OBDDs of small width (Q353910) (← links)
- Width hierarchy for \(k\)-OBDD of small width (Q748240) (← links)
- Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance (Q844146) (← links)
- BDDs -- design, analysis, complexity, and applications. (Q1428568) (← links)
- New size hierarchies for two way automata (Q1992112) (← links)
- Satisfiability algorithm for syntactic read-\(k\)-times branching programs (Q2032296) (← links)
- On the relative succinctness of sentential decision diagrams (Q2322709) (← links)
- On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs (Q2361671) (← links)
- Reordering method and hierarchies for quantum and classical ordered binary decision diagrams (Q2399372) (← links)
- On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth (Q2408558) (← links)
- Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication (Q2771493) (← links)
- Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs (Q5136279) (← links)
- The splitting power of branching programs of bounded repetition and CNFs of bounded width (Q6648277) (← links)
