Pages that link to "Item:Q4419787"

The following pages link to Efficient Boolean manipulation with OBDD's can be extended to FBDD's (Q4419787):

Displaying 19 items.

• Parity OBDDs cannot be handled efficiently enough (Q293348) (← links)
• Knowledge compilation meets database theory: compiling queries to decision diagrams (Q359877) (← links)
• A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (Q1007589) (← links)
• AND/OR search spaces for graphical models (Q1028898) (← links)
• Completeness and non-completeness results with respect to read-once projections (Q1271310) (← links)
• BDDs -- design, analysis, complexity, and applications. (Q1428568) (← links)
• On the evolution of the worst-case OBDD size (Q1607073) (← links)
• The complexity of minimizing and learning OBDDs and FBDDs (Q1613429) (← links)
• Formal verification based on Boolean expression diagrams (Q1954165) (← links)
• Minimization problems for parity OBDDs (Q2272213) (← links)
• Boolean expression diagrams (Q2506489) (← links)
• Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication (Q2508966) (← links)
• A very simple function that requires exponential size read-once branching programs. (Q2583538) (← links)
• Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication (Q2771493) (← links)
• On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision (Q4443390) (← links)
• Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs (Q4462678) (← links)
• On the relation between BDDs and FDDs (Q5096325) (← links)
• (Q5228561) (← links)
• Feature necessity \& relevancy in ML classifier explanations (Q6535350) (← links)