The following pages link to Developments in Language Theory (Q5473661):
Displaying 10 items.
- Comparative complexity of quantum and classical OBDDs for total and partial functions (Q906414) (← links)
- Unary probabilistic and quantum automata on promise problems (Q1617185) (← links)
- Relativizations of nonuniform quantum finite automata families (Q2326825) (← 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)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← 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)
