Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems
Keywords: تکمیل NP; Star discrepancy; Complexity; NP-completeness; Computational geometry