Pages that link to "Item:Q748240"
From MaRDI portal
The following pages link to Width hierarchy for \(k\)-OBDD of small width (Q748240):
Displaying 10 items.
- Quantum online algorithms with respect to space and advice complexity (Q669542) (← links)
- Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs (Q1275068) (← links)
- New size hierarchies for two way automata (Q1992112) (← links)
- Two-way and one-way quantum and classical automata with advice for online minimization problems (Q2139057) (← links)
- Very narrow quantum OBDDs and width hierarchies for classical OBDDs (Q2361670) (← 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)
- Testing Computability by Width Two OBDDs (Q3638913) (← links)
- Classical and Quantum Computations with Restricted Memory (Q6163622) (← links)