Login / Signup

Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas.

Dominik Scheder
Published in: ISAAC (2013)
Keyphrases
  • cnf formula
  • np complete
  • computational complexity
  • neural network
  • object oriented
  • decision problems
  • bounded treewidth
  • optimal solution
  • search algorithm
  • np hard
  • dynamic programming
  • space complexity