Pages that link to "Item:Q1349250"
From MaRDI portal
The following pages link to A rewriting approach to binary decision diagrams (Q1349250):
Displaying 8 items.
- Resolution and binary decision diagrams cannot simulate each other polynomially (Q1408378) (← links)
- Remodeling a DS-diagram into one with E-cycle (Q1583808) (← links)
- Zero, successor and equality in BDDs (Q1772774) (← links)
- Decomposing probabilistic lambda calculi (Q2200818) (← links)
- An efficient relational deductive system for propositional non-classical logics (Q3647245) (← links)
- A reducibility concept for problems defined in terms of ordered binary decision diagrams (Q5047173) (← links)
- A Term Rewriting Technique for Decision Graphs (Q5170280) (← links)
- Chain reduction for binary and zero-suppressed decision diagrams (Q5919614) (← links)