Pages that link to "Item:Q918199"

The following pages link to Polynomial size \(\Omega\)-branching programs and their computational power (Q918199):

Displaying 17 items.

• On the size of binary decision diagrams representing Boolean functions (Q673087) (← links)
• Graph driven BDDs -- a new data structure for Boolean functions (Q673788) (← links)
• Methods for proving completeness via logical reductions (Q685391) (← links)
• Oracle branching programs and Logspace versus \(P^*\) (Q1183604) (← links)
• Separating complexity classes related to \(\Omega\)-decision trees (Q1202936) (← links)
• Multi-head finite automata: Data-independent versus data-dependent computations (Q1608894) (← links)
• On arithmetic branching programs (Q1961372) (← links)
• Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication (Q2508966) (← 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)
• Oracle branching programs and Logspace versus P (Q3975161) (← links)
• Restricted branching programs and their computational power (Q3976028) (← links)
• (Q3991212) (← links)
• (Q4302457) (← links)
• Characterization and Lower Bounds for Branching Program Size Using Projective Dimension. (Q4636585) (← links)
• (Q4941163) (← links)
• European Summer Meeting of the Association for Symbolic Logic (Q5966661) (← links)