Pages that link to "Item:Q1187665"

The following pages link to Modified branching programs and their computational power (Q1187665):

Displaying 17 items.

• Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
• Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree (Q910223) (← links)
• The power of nondeterminism in polynomial-size bounded-width branching programs (Q1116338) (← links)
• Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits (Q1121671) (← links)
• Separating complexity classes related to \(\Omega\)-decision trees (Q1202936) (← links)
• On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs (Q1330665) (← links)
• A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy (Q2011643) (← links)
• (Q3197333) (← links)
• (Q4005192) (← links)
• Structure and importance of logspace-MOD class (Q4009813) (← links)
• Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access (Q4032302) (← links)
• (Q4035265) (← links)
• A reducibility concept for problems defined in terms of ordered binary decision diagrams (Q5047173) (← links)
• On the relation between BDDs and FDDs (Q5096325) (← links)
• Lower bounds for the modular communication complexity of various graph accessibility problems (Q5096349) (← links)
• Synthesis for testability: Binary Decision Diagrams (Q5096806) (← links)
• On the complexity of constructing optimal ordered binary decision diagrams (Q5096910) (← links)