The following pages link to Alex Samorodnitsky (Q178477):
Displaying 50 items.
- Kolmogorov width of discrete linear spaces: an approach to matrix rigidity (Q301519) (← links)
- Hafnians, perfect matchings and Gaussian matrices (Q317488) (← links)
- A note on the Newton radius (Q442332) (← links)
- Testing juntas (Q598252) (← links)
- On linear programming bounds for spherical codes and designs (Q701789) (← links)
- A lower bound on the integrality gap for minimum multicut in directed networks (Q705752) (← links)
- Random weighting, asymptotic counting, and inverse isoperimetry (Q995359) (← links)
- Linear programming bounds for codes via a covering argument (Q1017926) (← links)
- (Q1375691) (redirect page) (← links)
- Inclusion-exclusion: exact and approximate (Q1375692) (← links)
- Linear codes and character sums (Q1410404) (← links)
- A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary (Q1611062) (← links)
- On coset leader graphs of structured linear codes (Q1985294) (← links)
- On the round complexity of randomized Byzantine agreement (Q2121502) (← links)
- On the \(\ell_4:\ell_2\) ratio of functions with restricted Fourier support (Q2299644) (← links)
- Improved log-Sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube (Q2326494) (← links)
- An upper bound for permanents of nonnegative matrices (Q2474496) (← links)
- Inverse conjecture for the Gowers norm is false (Q2913795) (← links)
- Gowers uniformity, influence of variables, and PCPs (Q2931365) (← links)
- (Q2934616) (← links)
- Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity (Q2947571) (← links)
- On the Entropy of a Noisy Function (Q2976554) (← links)
- On Coset Leader Graphs of LDPC Codes (Q2977322) (← links)
- The Zero-Undetected-Error Capacity Approaches the Sperner Capacity (Q2986252) (← links)
- An approximation algorithm for counting contingency tables (Q3057067) (← links)
- Computing the Partition Function for Perfect Matchings in a Hypergraph (Q3103630) (← links)
- A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume (Q3191970) (← links)
- A PCP characterization of NP with optimal amortized query complexity (Q3191985) (← links)
- (Q3549650) (← links)
- Monotonicity testing over general poset domains (Q3579209) (← links)
- (Q4542587) (← links)
- Kolmogorov width of discrete linear spaces: an approach to matrix rigidity (Q4601836) (← links)
- (Q4780801) (← links)
- Testing Basic Boolean Formulae (Q4785704) (← links)
- (Q4941829) (← links)
- A Moment Ratio Bound for Polynomials and Some Extremal Properties of Krawchouk Polynomials and Hamming Spheres (Q5001736) (← links)
- Learning and Smoothed Analysis (Q5171189) (← links)
- Gowers Uniformity, Influence of Variables, and PCPs (Q5189548) (← links)
- A new perspective on implementation by voting trees (Q5198671) (← links)
- An Upper Bound on $\ell_q$ Norms of Noisy Functions (Q5211631) (← links)
- (Q5302078) (← links)
- An Inequality for Functions on the Hamming Cube (Q5366955) (← links)
- Edge-Isoperimetric Inequalities and Influences (Q5443800) (← links)
- Testing monotonicity (Q5932642) (← links)
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents (Q5932755) (← links)
- On the optimum of Delsarte's linear program (Q5953375) (← links)
- The distance approach to approximate combinatorial counting (Q5956633) (← links)
- One more proof of the first linear programming bound for binary codes and two conjectures (Q6050274) (← links)
- On the round complexity of randomized Byzantine agreement (Q6487529) (← links)
- Optimal discrimination between two pure states and Dolinar-type coherent-state detection (Q6576254) (← links)
