Parallel approximation of min-max problems
From MaRDI portal
Publication:354658
DOI10.1007/s00037-013-0065-9zbMath1286.68133arXiv1011.2787OpenAlexW2083633130MaRDI QIDQ354658
Publication date: 19 July 2013
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.2787
semidefinite programmingzero-sum gamesparallel approximation algorithmquantum interactive proofs with competing provers
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Parallel approximation of min-max problems ⋮ Complexity limitations on one-turn quantum refereed games ⋮ Epsilon-net method for optimizations over separable states
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel approximation of min-max problems
- Approximating linear programming is log-space complete for P
- Quantum Arthur-Merlin games
- On the complexity of succinct zero-sum games
- The complexity of two-person zero-sum games in extensive form
- A note on approximate linear programming
- Fast algorithms for finding randomized strategies in game trees
- Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
- Parallel Algorithms for Algebraic Problems
- On Relating Time and Space to Size and Depth
- Algebraic methods for interactive proof systems
- IP = PSPACE
- Cryptographic distinguishability measures for quantum-mechanical states
- Two-Message Quantum Interactive Proofs Are in PSPACE
- A parallel approximation algorithm for positive linear programming
- Online Variance Minimization
- QIP = PSPACE
- A Parallel Approximation Algorithm for Positive Semidefinite Programming
- STACS 2005
- Minimax Theorems
This page was built for publication: Parallel approximation of min-max problems
