Pages that link to "Item:Q3448798"
From MaRDI portal
The following pages link to Interactive Proofs with Approximately Commuting Provers (Q3448798):
Displaying 11 items.
- On the complexity of interactive proofs with bounded communication (Q293359) (← links)
- (Q4035675) (← links)
- (Q4341733) (← links)
- Interactive proofs and the hardness of approximating cliques (Q4371671) (← links)
- Compression of quantum multi-prover interactive proofs (Q4977979) (← links)
- Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision (Q5091777) (← links)
- (Q5093399) (← links)
- Constant-Round Interactive Proof Systems for AC0[2] and NC1 (Q5098783) (← links)
- From Operator Algebras to Complexity Theory and Back (Q5207391) (← links)
- Succinct interactive oracle proofs: applications and limitations (Q6155266) (← links)
- Doubly efficient interactive proofs over infinite and non-commutative rings (Q6169369) (← links)