Pages that link to "Item:Q550246"
From MaRDI portal
The following pages link to Unbounded-error quantum computation with small space bounds (Q550246):
Displayed 44 items.
- Computation with multiple CTCs of fixed length and width (Q256423) (← links)
- State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
- Superiority of exact quantum automata for promise problems (Q413305) (← links)
- Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
- The complexity of debate checking (Q493647) (← links)
- Unbounded-error quantum computation with small space bounds (Q550246) (← links)
- On the complexity of minimizing probabilistic and quantum automata (Q690502) (← links)
- Characterizations of one-way general quantum finite automata (Q764358) (← links)
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states (Q766174) (← links)
- Unary probabilistic and quantum automata on promise problems (Q1617185) (← links)
- Quantum computation with write-only memory (Q1761714) (← links)
- More on quantum, stochastic, and pseudo stochastic languages with few states (Q2003453) (← links)
- Improved constructions for succinct affine automata (Q2096598) (← links)
- Polynomially ambiguous probabilistic automata on restricted languages (Q2121470) (← links)
- Affine automata verifiers (Q2152088) (← links)
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata (Q2343133) (← links)
- On hybrid models of quantum finite automata (Q2353395) (← links)
- Quantum alternation (Q2361668) (← links)
- Very narrow quantum OBDDs and width hierarchies for classical OBDDs (Q2361670) (← links)
- When are emptiness and containment decidable for probabilistic automata? (Q2662671) (← links)
- Language Recognition Power and Succinctness of Affine Automata (Q2819147) (← links)
- Looking for Pairs that Hard to Separate: A Quantum Approach (Q2830222) (← links)
- Quantum Finite Automata: A Modern Introduction (Q2944891) (← links)
- From Quantum Query Complexity to State Complexity (Q2944893) (← links)
- Potential of Quantum Finite Automata with Exact Acceptance (Q2947961) (← links)
- One-Way Finite Automata with Quantum and Classical States (Q3166958) (← links)
- Complexity Bounds of Constant-Space Quantum Computation (Q3451121) (← links)
- On a Conjecture by Christian Choffrut (Q4605510) (← links)
- Quantum hedging in two-round prover-verifier interactions (Q4637979) (← links)
- Quantum Pushdown Automata with Garbage Tape (Q4640342) (← links)
- QUANTUM COUNTER AUTOMATA (Q4902895) (← links)
- SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES (Q4902896) (← links)
- (Q4988166) (← links)
- (Q5002806) (← links)
- Polynomially Ambiguous Probabilistic Automata on Restricted Languages (Q5091267) (← links)
- TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES (Q5168415) (← links)
- Uncountable classical and quantum complexity classes (Q5223610) (← links)
- (Q5232904) (← links)
- FINITE AUTOMATA WITH ADVICE TAPES (Q5247170) (← links)
- Affine Computation and Affine Automaton (Q5740183) (← links)
- Debates with Small Transparent Quantum Verifiers (Q5890816) (← links)
- How does adiabatic quantum computation fit into quantum automata theory? (Q5918616) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
- Language recognition power and succinctness of affine automata (Q6061995) (← links)