Login / Signup
On the relative efficiency of resolution-like proofs and ordered binary decision diagram proofs.
Nathan Segerlind
Published in:
Electron. Colloquium Comput. Complex. (2007)
Keyphrases
</>
theorem prover
theorem proving
binary decision diagrams
computational complexity
pseudo boolean constraints