Login / Signup

Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems.

Michael GnewuchAnand SrivastavCarola Winzen
Published in: J. Complex. (2009)
Keyphrases
  • finding optimal
  • np hard problems
  • constraint programming
  • np hard
  • knapsack problem
  • point sets
  • combinatorial search
  • graph coloring
  • state space
  • first order logic