Login / Signup

A note on the non-NP-hardness of approximate lattice problems under general Cook reductions.

Jin-yi CaiAjay Nerurkar
Published in: Inf. Process. Lett. (2000)
Keyphrases
  • np hardness
  • np hard
  • special case
  • approximation algorithms
  • evolutionary algorithm
  • optimization problems
  • linear programming
  • dynamical systems
  • mixed integer
  • worst case analysis