Pages that link to "Item:Q1293553"

The following pages link to Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams (Q1293553):

Displaying 9 items.

• Knowledge compilation meets database theory: compiling queries to decision diagrams (Q359877) (← links)
• Connecting knowledge compilation classes and width parameters (Q778533) (← links)
• Functions that have read-once branching programs of quadratic size are not necessarily testable (Q1014387) (← links)
• BDDs -- design, analysis, complexity, and applications. (Q1428568) (← links)
• On the descriptive and algorithmic power of parity ordered binary decision diagrams (Q1854421) (← links)
• On the relative succinctness of sentential decision diagrams (Q2322709) (← links)
• A hierarchy result for read-once branching programs with restricted parity nondeterminism (Q2566039) (← 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)