Pages that link to "Item:Q914382"

The following pages link to Lower bounds to the complexity of symmetric Boolean functions (Q914382):

Displaying 23 items.

• On the minimal Fourier degree of symmetric Boolean functions (Q397079) (← links)
• A Boolean function requiring 3n network size (Q794625) (← links)
• New upper bounds on the Boolean circuit complexity of symmetric functions (Q991778) (← links)
• Functions that have read-once branching programs of quadratic size are not necessarily testable (Q1014387) (← links)
• There are no p-complete families of symmetric Boolean functions (Q1114662) (← links)
• Meanders and their applications in lower bounds arguments (Q1115606) (← links)
• The complexity of computing symmetric functions using threshold circuits (Q1193637) (← links)
• Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC (Q1317485) (← links)
• Two tapes versus one for off-line Turing machines (Q1321033) (← links)
• Efficient oblivious branching programs for threshold and mod functions (Q1384527) (← links)
• Almost \(k\)-wise independence and hard Boolean functions. (Q1401305) (← links)
• On the complexity of planar Boolean circuits (Q1842774) (← links)
• Average complexity of symmetric Boolean functions (Q1878531) (← links)
• Upper bounds on the multiplicative complexity of symmetric Boolean functions (Q2179499) (← links)
• On lower bounds for read-\(k\)-times branching programs (Q2366719) (← links)
• Bounds on the Fourier coefficients of the weighted sum function (Q2379949) (← links)
• The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
• A lower bound for the affinity level for almost all Boolean functions (Q3184567) (← links)
• (Q3197333) (← links)
• (Q3822100) (← links)
• On the Complexity of the Hidden Weighted Bit Function for Various BDD Models (Q4265532) (← links)
• (Q4301458) (← links)
• Unexpected upper bounds on the complexity of some communication games (Q4632411) (← links)