The following pages link to Finite state verifiers I (Q4302790):
Displaying 42 items.
- State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
- The complexity of debate checking (Q493647) (← links)
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- Multihead two-way probabilistic finite automata (Q675857) (← links)
- Non-deterministic exponential time has two-prover interactive protocols (Q685724) (← links)
- On the power of interaction (Q751809) (← links)
- On some variations of two-way probabilistic finite automata models (Q880179) (← links)
- Checking the correctness of memories (Q890427) (← links)
- An application of quantum finite automata to interactive proof systems (Q1015813) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- Multi-oracle interactive protocols with constant space verifiers (Q1190986) (← links)
- A note on two-dimensional probabilistic finite automata (Q1298347) (← links)
- A limit theorem for sets of stochastic matrices. (Q1430373) (← links)
- Closure properties of the classes of sets recognized by space-bounded two-dimensional probabilistic Turing machines (Q1818780) (← links)
- A note on two-dimensional probabilistic Turing machines (Q1818955) (← links)
- Two-way finite automata with quantum and classical states. (Q1853472) (← links)
- PSPACE has constant-round quantum interactive proof systems (Q1870552) (← links)
- Fast approximate probabilistically checkable proofs (Q1881217) (← links)
- Interactive proof systems with polynomially bounded strategies (Q1894457) (← links)
- Constant-space, constant-randomness verifiers with arbitrarily small error (Q2084769) (← links)
- Affine automata verifiers (Q2152088) (← links)
- Constant-space quantum interactive proofs against multiple provers (Q2252642) (← links)
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata (Q2343133) (← links)
- Interactive proofs with quantum finite automata (Q2513604) (← links)
- Finite state verifiers with constant randomness (Q2878753) (← links)
- Multiple Usage of Random Bits in Finite Automata (Q2898066) (← links)
- Complexity Bounds of Constant-Space Quantum Computation (Q3451121) (← links)
- ON THE POWER OF QUANTUM TAMPER-PROOF DEVICES (Q3534215) (← links)
- Group Input Machine (Q3599100) (← links)
- Size Complexity of Two-Way Finite Automata (Q3637213) (← links)
- Interactive proof systems (Q3830531) (← links)
- Interactive proofs and applications (Q4011253) (← links)
- Random walks on colored graphs (Q4286296) (← links)
- Lower space bounds for randomized computation (Q4632458) (← links)
- SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES (Q4902896) (← links)
- (Q5016371) (← links)
- Interactive proof systems with public coin: Lower space bounds and hierarchies of complexity classes (Q5047165) (← links)
- Multihead two-way probabilistic finite automata (Q5096345) (← links)
- FINITE AUTOMATA WITH ADVICE TAPES (Q5247170) (← links)
- Debates with small transparent quantum verifiers (Q5890816) (← links)
- Probabilistic rebound Turing machines (Q5958328) (← links)
- Exact Affine Counter Automata (Q6114873) (← links)
