The following pages link to Alexander A. Sherstov (Q623503):
Displaying 48 items.
- (Q368234) (redirect page) (← links)
- A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length (Q368235) (← links)
- Communication complexity under product and nonproduct distributions (Q623504) (← links)
- Approximate inclusion-exclusion for arbitrary symmetric functions (Q626621) (← links)
- Lower bounds for agnostic learning via approximate rank (Q626689) (← links)
- Powering requires threshold depth 3 (Q845974) (← links)
- Halfspace matrices (Q937198) (← links)
- Unconditional lower bounds for learning intersections of halfspaces (Q1009217) (← links)
- The hardest halfspace (Q1983325) (← links)
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- The Multiparty Communication Complexity of Set Disjointness (Q2817790) (← links)
- (Q2913808) (← links)
- Communication Complexity Theory: Thirty-Five Years of Set Disjointness (Q2921999) (← links)
- (Q3002823) (← links)
- The Sign-Rank of AC$^0$ (Q3053151) (← links)
- (Q3171603) (← links)
- (Q3191588) (← links)
- (Q3191590) (← links)
- The Pattern Matrix Method (Q3225179) (← links)
- (Q3396635) (← links)
- (Q3549625) (← links)
- (Q3549688) (← links)
- Reducing by 1 the degree of a polynomial with fixed sign function can increase exponentially its weight and length (Q3550940) (← links)
- Separating ${AC}^0$ from Depth-2 Majority Circuits (Q3654371) (← links)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
- The Power of Asymmetry in Constant-Depth Circuits (Q4562278) (← links)
- (Q4612487) (← links)
- Compressing Interactive Communication Under Product Distributions (Q4637503) (← links)
- Strong Direct Product Theorems for Quantum Communication and Query Complexity (Q4907578) (← links)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- The Intersection of Two Halfspaces Has High Threshold Degree (Q5171185) (← links)
- Optimal Interactive Coding for Insertions, Deletions, and Substitutions (Q5211421) (← links)
- Near-optimal lower bounds on the threshold degree and sign-rank of AC <sup>0</sup> (Q5212781) (← links)
- Algorithmic polynomials (Q5230299) (← links)
- Breaking the minsky-papert barrier for constant-depth circuits (Q5259556) (← links)
- Improved Lower Bounds for Learning Intersections of Halfspaces (Q5307578) (← links)
- The Intersection of Two Halfspaces Has High Threshold Degree (Q5408769) (← links)
- The multiparty communication complexity of set disjointness (Q5415499) (← links)
- Making polynomials robust to noise (Q5415513) (← links)
- A Lower Bound for Agnostically Learning Disjunctions (Q5434065) (← links)
- Communication lower bounds using directional derivatives (Q5495864) (← links)
- Communication Lower Bounds Using Directional Derivatives (Q5501937) (← links)
- Inner Product and Set Disjointness (Q5862288) (← links)
- An Optimal Separation of Randomized and Quantum Query Complexity (Q5890036) (← links)
- Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← links)
- (Q6176153) (← links)
