Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision.
Matthew CoudronWilliam SlofstraPublished in: CoRR (2019)
Keyphrases
- high precision
- lower bound
- high recall
- worst case
- upper bound
- high reliability
- branch and bound algorithm
- average case complexity
- high accuracy
- achieve high precision
- branch and bound
- upper and lower bounds
- average case
- np hard
- special case
- complexity measures
- objective function
- decision problems
- game theory
- computer games
- computational cost
- game playing
- game theoretic
- lower and upper bounds