Pages that link to "Item:Q1575258"

The following pages link to A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs (Q1575258):

Displaying 11 items.

• On the average sensitivity of the weighted sum function (Q413263) (← links)
• Laced Boolean functions and subset sum problems in finite fields (Q2275906) (← links)
• On the relative succinctness of sentential decision diagrams (Q2322709) (← links)
• New lower bounds on circuit size of multi-output functions (Q2354591) (← links)
• Bounds on the Fourier coefficients of the weighted sum function (Q2379949) (← links)
• Reordering method and hierarchies for quantum and classical ordered binary decision diagrams (Q2399372) (← links)
• A very simple function that requires exponential size read-once branching programs. (Q2583538) (← links)
• A Well-Mixed Function with Circuit Complexity 5n ±o(n): Tightness of the Lachish-Raz-Type Bounds (Q3502659) (← links)
• Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs (Q4462678) (← links)
• The simplified weighted sum function and its average sensitivity (Q5964818) (← links)
• Error-Free Affine, Unitary, and Probabilistic OBDDs (Q6169903) (← links)