Pages that link to "Item:Q5091777"

The following pages link to Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision (Q5091777):

Displayed 2 items.

• (Q5226195) ‎ (← links)
• 3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time (Q6040865) ‎ (← links)