Login / Signup

New bounds for distance-type problems over prime fields.

Alex IosevichDoowon KohThang Pham
Published in: Eur. J. Comb. (2020)
Keyphrases
  • upper bound
  • np complete
  • problems involving
  • database
  • optimization problems
  • real time
  • data sets
  • databases
  • np hard
  • dynamic programming
  • benchmark problems
  • mathematical programming