Login / Signup

No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth.

Igor Razgon
Published in: IPEC (2014)
Keyphrases
  • bounded treewidth
  • np complete
  • databases
  • highly parallelizable
  • knowledge representation
  • data warehouse
  • boolean functions