Finite state verifiers I
From MaRDI portal
Recommendations
Cited in
(53)- An application of quantum finite automata to interactive proof systems
- Theory of one-tape linear-time Turing machines
- A note on two-dimensional probabilistic finite automata
- A limit theorem for sets of stochastic matrices.
- Closure properties of the classes of sets recognized by space-bounded two-dimensional probabilistic Turing machines
- A note on two-dimensional probabilistic Turing machines
- Two-way finite automata with quantum and classical states.
- PSPACE has constant-round quantum interactive proof systems
- Fast approximate probabilistically checkable proofs
- Interactive proof systems with polynomially bounded strategies
- Constant-space, constant-randomness verifiers with arbitrarily small error
- Affine automata verifiers
- Constant-space quantum interactive proofs against multiple provers
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
- Interactive proofs with quantum finite automata
- Finite state verifiers with constant randomness
- Multiple usage of random bits in finite automata
- Finite state verifiers with constant randomness
- scientific article; zbMATH DE number 4180787 (Why is no real title available?)
- Complexity bounds of constant-space quantum computation
- ON THE POWER OF QUANTUM TAMPER-PROOF DEVICES
- Group Input Machine
- Size Complexity of Two-Way Finite Automata
- On memoryless provers and insincere verifiers
- scientific article; zbMATH DE number 4106274 (Why is no real title available?)
- State succinctness of two-way finite automata with quantum and classical states
- scientific article; zbMATH DE number 66620 (Why is no real title available?)
- Random walks on colored graphs
- Finite state verifiers II
- IP = PSPACE
- Lower space bounds for randomized computation
- Some languages recognized by two-way finite automata with quantum and classical states
- The complexity of debate checking
- Exact affine counter automata
- Interactive proof systems with public coin: lower space bounds and hierarchies of complexity classes
- Multihead two-way probabilistic finite automata (extended abstract)
- Promise problems solved by quantum and classical finite automata
- Finite automata with advice tapes
- Debates with small transparent quantum verifiers
- Probabilistic rebound Turing machines
- Exact Affine Counter Automata
- Making \(\mathsf{IP}=\mathsf{PSPACE}\) practical: efficient interactive protocols for BDD algorithms
- Multihead two-way probabilistic finite automata
- The power of a single qubit: two-way quantum finite automata and the word problem
- Non-deterministic exponential time has two-prover interactive protocols
- Classical and quantum Merlin-Arthur automata
- Unconditional proofs of quantumness between small-space machines
- Time hierarchies for sublogarithmic-space quantum computation
- Lower bounds on the running time of two-way quantum finite automata and sublogarithmic-space quantum Turing machines
- \(\mathrm{P}\) has polynomial-time finite-state verifiers
- On the power of interaction
- On some variations of two-way probabilistic finite automata models
- Checking the correctness of memories
This page was built for publication: Finite state verifiers I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302790)
