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 28 items.

• On the read-once property of branching programs and CNFs of bounded treewidth (Q309788) (← links)
• On the average sensitivity of the weighted sum function (Q413263) (← links)
• Incremental branching programs (Q929291) (← links)
• The optimal read-once branching program complexity for the direct storage access function (Q963361) (← links)
• A lower bound for read-once-only branching programs (Q1107323) (← links)
• A lower bound on branching programs reading some bits twice (Q1392030) (← links)
• On uncertainty versus size in branching programs. (Q1401198) (← links)
• New lower bounds and hierarchy results for restricted branching programs (Q1816743) (← 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)
• On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs (Q2361671) (← 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 hierarchy result for read-once branching programs with restricted parity nondeterminism (Q2566039) (← links)
• A very simple function that requires exponential size read-once branching programs. (Q2583538) (← links)
• A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 (Q2891385) (← links)
• A Well-Mixed Function with Circuit Complexity 5n ±o(n): Tightness of the Lachish-Raz-Type Bounds (Q3502659) (← links)
• A new lower bound theorem for read-only-once branching programs and its applications (Q4287364) (← links)
• A note on read-$k$ times branching programs (Q4362278) (← links)
• Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs (Q4462678) (← links)
• (Q4471998) (← links)
• (Q4542589) (← links)
• A Direct-Sum Theorem for Read-Once Branching Programs (Q4636478) (← links)
• (Q4699324) (← links)
• On the hierarchy of nondeterministic branching k-programs (Q5055950) (← links)
• The simplified weighted sum function and its average sensitivity (Q5964818) (← links)
• Error-Free Affine, Unitary, and Probabilistic OBDDs (Q6169903) (← links)