Pages that link to "Item:Q1107323"

The following pages link to A lower bound for read-once-only branching programs (Q1107323):

Displaying 17 items.

• A simple function that requires exponential size read-once branching programs (Q287023) (← links)
• On the size of binary decision diagrams representing Boolean functions (Q673087) (← links)
• 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)
• Neither reading few bits twice nor reading illegally helps much (Q1130185) (← links)
• Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus (Q1416118) (← links)
• A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs (Q1575258) (← links)
• Time-space tradeoffs for branching programs (Q1604208) (← links)
• On lower bounds for read-\(k\)-times branching programs (Q2366719) (← links)
• A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 (Q2891385) (← links)
• (Q4009550) (← links)
• (Q4259991) (← links)
• (Q4471998) (← links)
• (Q4542589) (← links)
• On the hierarchy of nondeterministic branching k-programs (Q5055950) (← links)
• Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. (Q5111240) (← links)
• Read-Once Branching Programs for Tree Evaluation Problems (Q5205806) (← links)