Pages that link to "Item:Q1024660"
From MaRDI portal
The following pages link to On the complexity of succinct zero-sum games (Q1024660):
Displaying 16 items.
- The complexity of estimating min-entropy (Q260395) (← links)
- Parallel approximation of min-max problems (Q354658) (← links)
- Arthur and Merlin as oracles (Q649095) (← links)
- The 1-versus-2 queries problem revisited (Q970102) (← links)
- The landscape of communication complexity classes (Q1653337) (← links)
- Correspondence between quantization schemes for two-player nonzero-sum games and CNOT complexity (Q1654117) (← links)
- On Dedekind's problem for complete simple games (Q2376066) (← links)
- On zero error algorithms having oracle access to one query (Q2498984) (← links)
- Simple strategies for large zero-sum games with applications to complexity theory (Q2817668) (← links)
- The complexity of the nucleolus in compact games (Q2828226) (← links)
- On the Complexity of n-Player Hackenbush (Q3400102) (← links)
- Weighted Boolean Formula Games (Q3464467) (← links)
- On the Complexity of Equilibria Problems in Angel-Daemon Games (Q3511310) (← links)
- Arthur and Merlin as Oracles (Q3599130) (← links)
- On the complexity of problems on simple games (Q5388151) (← links)
- Complexity limitations on one-turn quantum refereed games (Q6038714) (← links)