The following pages link to Guy Kindler (Q430832):
Displaying 43 items.
- Hardness of approximating the closest vector problem with pre-processing (Q430834) (← links)
- The geometry of manipulation -- a quantitative proof of the Gibbard-Satterthwaite theorem (Q452827) (← links)
- Testing juntas (Q598252) (← links)
- PCP characterizations of NP: toward a polynomially-small error-probability (Q649097) (← links)
- Gaussian noise sensitivity and Fourier tails (Q1650030) (← links)
- (Q1878612) (redirect page) (← links)
- Approximating CVP to within almost-polynomial factors is NP-hard (Q1878613) (← links)
- On non-optimally expanding sets in Grassmann graphs (Q2048867) (← links)
- Towards a proof of the Fourier-entropy conjecture? (Q2216459) (← links)
- Quantitative relation between noise sensitivity and influences (Q2448963) (← links)
- On the Fourier tails of bounded functions over the discrete cube (Q2480580) (← links)
- Eliminating cycles in the discrete torus (Q2482730) (← links)
- PCP characterizations of NP (Q2819531) (← links)
- Geometric stability via information theory (Q2826226) (← links)
- On the fourier tails of bounded functions over the discrete cube (Q2931406) (← links)
- Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition (Q2941514) (← links)
- On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction (Q2986870) (← links)
- Direct Sum Testing (Q2989047) (← links)
- The UGC Hardness Threshold of the <i>L<sub>p</sub></i> Grothendieck Problem (Q3169093) (← links)
- Eliminating Cycles in the Discrete Torus (Q3525760) (← links)
- Lower Bounds for the Noisy Broadcast Problem (Q3549324) (← links)
- (Q3579368) (← links)
- Approximation of non-boolean 2CSP (Q4575701) (← links)
- On Distributions Computable by Random Walks on Graphs (Q4652612) (← links)
- Invariance Principle on the Slice (Q4973879) (← links)
- (Q5092467) (← links)
- (Q5111344) (← links)
- Towards a proof of the 2-to-1 games conjecture? (Q5230304) (← links)
- On non-optimally expanding sets in Grassmann graphs (Q5230352) (← links)
- Direct Sum Testing (Q5348457) (← links)
- Invariance principle on the slice (Q5368749) (← links)
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? (Q5454254) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479378) (← links)
- (Q5500595) (← links)
- (Q5501250) (← links)
- Simulating independence (Q5901033) (← links)
- Simulating independence (Q5901100) (← links)
- The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs (Q6071822) (← links)
- Hypercontractivity on the symmetric group (Q6178439) (← links)
- Product Mixing in Compact Lie Groups (Q6519193) (← links)
- Polynomial Bogolyubov for special linear groups via tensor rank (Q6528578) (← links)
- Limits of preprocessing (Q6581870) (← links)
- Improved monotonicity testers via hypercube embeddings (Q6610288) (← links)
