Validity checking for combinations of theories with equality
Lecture notes in computer science1996pp. 187–201
Citations Over TimeTop 10% of 1996 papers
Related Papers
- → On the OBDD-representation of general Boolean functions(1992)138 cited
- → The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions(1994)34 cited
- → Efficient symbolic computation of generalised spectra(1997)2 cited
- Characteristics of the binary decision diagrams of Boolean Bent Functions(2009)
- → Binary Decision Diagrams(2010)