17 citations · 24 across the 5 of their papers we have counts for
1 paper · 1 filter
Jan Hązła, Thomas Holenstein, Anup Rao
We study a special kind of bounds (so called forbidden subgraph bounds, cf. Feige, Verbitsky '02) for parallel repetition of multi-prover games. First, we show that forbidden subgr…