The following pages link to (Q3396635):
Displayed 14 items.
- A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length (Q368235) (← links)
- How low can approximate degree and quantum query complexity be for total Boolean functions? (Q488052) (← links)
- One-way multiparty communication lower bound for pointer jumping with applications (Q532058) (← links)
- On the parity complexity measures of Boolean functions (Q974756) (← links)
- The hardest halfspace (Q1983325) (← links)
- Dual lower bounds for approximate degree and Markov-Bernstein inequalities (Q2347795) (← links)
- Degree-uniform lower bound on the weights of polynomials with given sign function (Q2510769) (← links)
- Polynomial threshold functions and Boolean threshold circuits (Q2514146) (← links)
- Hardness Amplification and the Approximate Degree of Constant-Depth Circuits (Q3448791) (← links)
- An Algebraic Perspective on Boolean Function Learning (Q3648753) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- (Q5140844) (← links)
- Rectangles Are Nonnegative Juntas (Q5890971) (← links)