Pages that link to "Item:Q2771493"

The following pages link to Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication (Q2771493):

Displaying 10 items.

• A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (Q1007589) (← links)
• Reduced error pruning of branching programs cannot be approximated to within a logarithmic factor (Q1014397) (← links)
• The power of nondeterminism in polynomial-size bounded-width branching programs (Q1116338) (← links)
• A lower bound for integer multiplication on randomized ordered read-once branching programs. (Q1426006) (← links)
• On the OBDD complexity of the most significant bit of integer multiplication (Q2430011) (← links)
• Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication (Q2508966) (← links)
• A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications (Q2581005) (← links)
• On the OBDD Complexity of the Most Significant Bit of Integer Multiplication (Q3502656) (← links)
• (Q3821583) (← links)
• Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs (Q4462678) (← links)