Login / Signup

Time-approximation trade-offs for inapproximable problems.

Édouard BonnetMichael LampisVangelis Th. Paschos
Published in: J. Comput. Syst. Sci. (2018)
Keyphrases
  • trade off
  • neural network
  • databases
  • solving problems
  • upper bound
  • computer vision
  • information systems
  • e learning
  • knowledge base
  • multi objective
  • np hard
  • np complete
  • error bounds
  • related problems