Login / Signup

On the hardness of approximating Max-Satisfy.

Uriel FeigeDaniel Reichman
Published in: Inf. Process. Lett. (2006)
Keyphrases
  • information retrieval
  • np complete
  • search algorithm
  • computational complexity
  • information theoretic
  • database
  • information systems
  • hidden markov models
  • medical images
  • phase transition
  • np hardness