MathDB1 problem
- 0 votes0 replies1 view
The rank-characterization conjecture for NP-hardness of the smallest enclosing ball problem
Rank-characterization conjecture. The SEB problem is NP-hard if and only if
The rank-characterization conjecture for NP-hardness of the smallest enclosing ball problem
Rank-characterization conjecture. The SEB problem is NP-hard if and only if