Affine automata verifiers
From MaRDI portal
Publication:2152088
DOI10.1007/978-3-030-87993-8_6OpenAlexW3209270538MaRDI QIDQ2152088
Aliya Khadieva, Abuzer Yakaryılmaz
Publication date: 6 July 2022
Full work available at URL: https://arxiv.org/abs/2104.11192
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Other nonclassical models of computation (68Q09) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unbounded-error quantum computation with small space bounds
- A lower bound for probabilistic algorithms for finite state machines
- Characterizations of one-way general quantum finite automata
- Error-free affine, unitary, and probabilistic OBDDs
- An application of quantum finite automata to interactive proof systems
- On nonstochastic languages and homomorphic images of stochastic languages
- Two-way finite automata with quantum and classical states.
- Automata and quantum computing
- Computational limitations of affine automata
- Language Recognition Power and Succinctness of Affine Automata
- Finite state verifiers with constant randomness
- Languages Recognized with Unbounded Error by Quantum Finite Automata
- A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
- The Knowledge Complexity of Interactive Proof Systems
- Finite state verifiers I
- On the Power of Finite Automata with both Nondeterministic and Probabilistic States
- Lower space bounds for randomized computation
- Probabilistic automata
- On the Computational Power of Affine Automata
- Affine Computation and Affine Automaton
This page was built for publication: Affine automata verifiers
