Pages that link to "Item:Q4011253"
From MaRDI portal
The following pages link to Interactive proofs and applications (Q4011253):
Displaying 29 items.
- On the power of interaction (Q751809) (← links)
- Does co-NP have short interactive proofs ? (Q1108004) (← links)
- Randomness in interactive proofs (Q1321030) (← links)
- On the power of multi-prover interactive protocols (Q1341733) (← links)
- On interactive proofs with a laconic prover (Q1413647) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- Interactive protocols over the reals (Q1587345) (← links)
- Proving properties of interactive proofs by a generalized counting technique (Q1825663) (← links)
- Interactive proof systems with polynomially bounded strategies (Q1894457) (← links)
- A logic of interactive proofs (Q2151405) (← links)
- Interactive proofs and a Shamir-like result for real number computations (Q2323360) (← links)
- Multi-prover interactive proofs: unsound foundations (Q2412247) (← links)
- Interactive Coding for Interactive Proofs (Q2799101) (← links)
- Input-oblivious proof systems and a uniform complexity perspective on P/poly (Q2828212) (← links)
- (Q3549691) (← links)
- Interactive proof systems (Q3830531) (← links)
- Finite state verifiers I (Q4302790) (← links)
- Algebraic methods for interactive proof systems (Q4302792) (← links)
- On Doubly-Efficient Interactive Proof Systems (Q4571853) (← links)
- Real Interactive Proofs for VPSPACE. (Q4608572) (← links)
- Pseudo-deterministic Proofs (Q4993280) (← links)
- Simple doubly-efficient interactive proof systems for locally-characterizable sets (Q4993281) (← links)
- Interactive proof systems with public coin: Lower space bounds and hierarchies of complexity classes (Q5047165) (← links)
- Interactive Distributed Proofs (Q5197691) (← links)
- Automata, Languages and Programming (Q5466484) (← links)
- Interactive Termination Proofs Using Termination Cores (Q5747661) (← links)
- Succinct interactive oracle proofs: applications and limitations (Q6155266) (← links)
- Doubly efficient interactive proofs over infinite and non-commutative rings (Q6169369) (← links)
- Logspace verifiers, NC, and NP (Q6487945) (← links)