default search action
"Lower Bounds on the Running Time of Two-Way Quantum Finite Automata and ..."
Zachary Remscrim (2021)
- Zachary Remscrim:
Lower Bounds on the Running Time of Two-Way Quantum Finite Automata and Sublogarithmic-Space Quantum Turing Machines. ITCS 2021: 39:1-39:20
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.