Pages that link to "Item:Q3990097"

The following pages link to Polynomial Threshold Functions, $AC^0 $ Functions, and Spectral Norms (Q3990097):

Displaying 20 items.

• A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length (Q368235) (← links)
• Improved approximation of linear threshold functions (Q371200) (← links)
• Majority gates vs. general weighted threshold gates (Q1210330) (← links)
• Spectral properties of threshold functions (Q1323477) (← links)
• Reflections on ``Representations of sets of Boolean functions by commutative rings'' by Roman Smolensky (Q1377573) (← links)
• Randomization and the computational power of analytic and algebraic decision trees (Q1386179) (← links)
• Evaluating spectral norms for constant depth circuits with symmetric gates (Q1904669) (← links)
• Computing sparse approximations deterministically (Q1915603) (← links)
• Pseudorandom generators and learning algorithms for \(\mathrm{AC}^ 0\) (Q1918950) (← links)
• Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
• Bounds on the Fourier coefficients of the weighted sum function (Q2379949) (← links)
• Extremal properties of polynomial threshold functions (Q2475403) (← links)
• Polynomial threshold functions and Boolean threshold circuits (Q2514146) (← links)
• Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
• On small depth threshold circuits (Q5056127) (← links)
• Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
• A Lifting Theorem with Applications to Symmetric Functions (Q5136315) (← links)
• Counting Solutions to Polynomial Systems via Reductions (Q5240420) (← links)
• Approximate F_2-Sketching of Valuation Functions (Q5875529) (← links)
• Noise sensitivity of Boolean functions and applications to percolation (Q5932371) (← links)