The following pages link to (Q2766857):
Displaying 7 items.
- Comparative complexity of quantum and classical OBDDs for total and partial functions (Q906414) (← links)
- Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
- Very narrow quantum OBDDs and width hierarchies for classical OBDDs (Q2361670) (← links)
- Nondeterministic unitary OBDDs (Q2399370) (← links)
- Reordering method and hierarchies for quantum and classical ordered binary decision diagrams (Q2399372) (← links)
- On the computational power of probabilistic and quantum branching program (Q2581534) (← links)
- Computing Boolean Functions via Quantum Hashing (Q2944885) (← links)
