Login / Signup

On the Relative Efficiency of Resolution-Like Proofs and Ordered Binary Decision Diagram Proofs.

Nathan Segerlind
Published in: Computational Complexity Conference (2008)
Keyphrases
  • theorem proving
  • general purpose
  • binary decision diagrams
  • search algorithm
  • computational complexity
  • database
  • machine learning
  • relational databases
  • state space