Complexity Lower Bounds for Computing the Approximately-Commuting Operator Value of Non-Local Games to High Precision.
Matthew CoudronWilliam SlofstraPublished in: Computational Complexity Conference (2019)
Keyphrases
- high precision
- lower bound
- high recall
- worst case
- upper bound
- high reliability
- branch and bound algorithm
- computational complexity
- average case complexity
- np hard
- objective function
- achieve high precision
- complexity measures
- game theoretic
- high accuracy
- multi agent
- memory requirements
- computer games
- optimal solution
- serious games
- space complexity
- average case
- nash equilibria
- game theory
- learning algorithm