Pages that link to "Item:Q1333272"

The following pages link to Approximating threshold circuits by rational functions (Q1333272):

Displaying 15 items.

• A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length (Q368235) (← links)
• A size-depth trade-off for the analog computation of Boolean functions (Q671617) (← links)
• When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one (Q1346613) (← links)
• A new theorem in threshold logic and its application to multioperand binary adders (Q4467334) (← links)
• Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
• The Power of Asymmetry in Constant-Depth Circuits (Q4562278) (← links)
• Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits (Q4568115) (← links)
• Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
• Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
• Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity (Q5091770) (← links)
• Algorithmic Polynomials (Q5138783) (← links)
• Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← links)
• New degree bounds for polynomial threshold functions (Q5894427) (← links)
• On Blocky Ranks Of Matrices (Q6489336) (← links)
• Neural networks with linear threshold activations: structure and algorithms (Q6589753) (← links)