Login / Signup

Improving resolution width lower bounds for k-CNFs with applications to the Strong Exponential Time Hypothesis.

Ilario BonacinaNavid Talebanfard
Published in: Inf. Process. Lett. (2016)
Keyphrases
  • lower bound
  • upper bound
  • average case complexity
  • branch and bound algorithm
  • branch and bound
  • np hard
  • neural network
  • low resolution
  • data structure
  • multiresolution
  • lower and upper bounds
  • average case