The following pages link to (Q4388806):
Displayed 23 items.
- XML compression via directed acyclic graphs (Q269349) (← links)
- On a class of decision diagrams (Q329079) (← links)
- Decomposition of systems of Boolean functions determined by binary decision diagrams (Q353738) (← links)
- Decomposition representations of logical equations in problems of inversion of discrete functions (Q404200) (← links)
- Compact representations of all members of an independence system (Q513340) (← links)
- A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria (Q747538) (← links)
- Connecting knowledge compilation classes and width parameters (Q778533) (← links)
- Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram (Q893916) (← links)
- A rewriting approach to binary decision diagrams (Q1349250) (← links)
- Resolution and binary decision diagrams cannot simulate each other polynomially (Q1408378) (← links)
- Minimization of binary decision diagrams for systems of incompletely defined Boolean functions (Q2017631) (← links)
- On the computation of the Möbius transform (Q2290627) (← links)
- Tree compression with top trees (Q2347804) (← links)
- Bounded model checking of infinite state systems (Q2369883) (← links)
- Better upper bounds on the QOBDD size of integer multiplication (Q2370421) (← links)
- Processing succinct matrices and vectors (Q2411035) (← links)
- Extended resolution simulates binary decision diagrams (Q2478427) (← links)
- Minimizing binary decision diagrams for systems of incompletely defined Boolean functions using algebraic cofactor expansions (Q2695132) (← links)
- (Q5146113) (← links)
- (Q5146738) (← links)
- ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES (Q5148102) (← links)
- (Q5866338) (← links)
- Experimental study of algorithms for minimization of binary decision diagrams using algebraic representations of cofactors (Q6094421) (← links)