Upper bound
{NP}^{NP} (which is \Sigma_2^P - level 2 in the polynomial hierarchy)
Open the “1. Computational complexity” section on Wikipedia →
Source: List of unsolved problems in fair division (CC BY-SA 4.0)
All › Fair division › 1. Computational complexity
{NP}^{NP} (which is \Sigma_2^P - level 2 in the polynomial hierarchy)
Open the “1. Computational complexity” section on Wikipedia →
Source: List of unsolved problems in fair division (CC BY-SA 4.0)