Pages that link to "Item:Q2581534"
From MaRDI portal
The following pages link to On the computational power of probabilistic and quantum branching program (Q2581534):
Displaying 18 items.
- Quantum online algorithms with respect to space and advice complexity (Q669542) (← links)
- Width hierarchy for \(k\)-OBDD of small width (Q748240) (← links)
- Comparative complexity of quantum and classical OBDDs for total and partial functions (Q906414) (← links)
- Unary probabilistic and quantum automata on promise problems (Q1617185) (← links)
- Two-way and one-way quantum and classical automata with advice for online minimization problems (Q2139057) (← links)
- Quantum online streaming algorithms with logarithmic memory (Q2241048) (← 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)
- Nondeterministic unitary OBDDs (Q2399370) (← links)
- Reordering method and hierarchies for quantum and classical ordered binary decision diagrams (Q2399372) (← links)
- Computing Boolean Functions via Quantum Hashing (Q2944885) (← links)
- (Q3115585) (← links)
- On quantum realisation of Boolean functions by the fingerprinting technique (Q3225895) (← links)
- (Q4737169) (← links)
- Quantum versus classical online streaming algorithms with logarithmic size of memory (Q6043926) (← links)
- Deterministic construction of QFAs based on the quantum fingerprinting technique (Q6043928) (← links)
- Classical and Quantum Computations with Restricted Memory (Q6163622) (← links)
- Error-Free Affine, Unitary, and Probabilistic OBDDs (Q6169903) (← links)
