122 results on '"Prahladh Harsha"'
Search Results
2. Dot-Product Proofs and Their Applications.
3. An Improved Line-Point Low-Degree Test.
4. On the Elementary Construction of High-Dimensional Expanders by Kaufman and Oppenheim.
5. Ideal-Theoretic Explanation of Capacity-Achieving Decoding.
6. Decoding Multivariate Multiplicity Codes on Product Sets.
7. Boolean Function Analysis on High-Dimensional Expanders.
8. Rigid Matrices from Rectangular PCPs.
9. Criticality of AC⁰-Formulae.
10. Fast Numerical Multivariate Multipoint Evaluation.
11. Downward Self-Reducibility in TFNP.
12. Algorithmizing the Multiplicity Schwartz-Zippel Lemma.
13. Sparse juntas on the biased hypercube.
14. Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes.
15. Mixing of 3-Term Progressions in Quasirandom Groups.
16. From Local to Robust Testing via Agreement Testing.
17. An Improved Line-Point Low-Degree Test.
18. Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes.
19. Decoding multivariate multiplicity codes on product sets.
20. Explicit SoS Lower Bounds from High-Dimensional Expanders.
21. Ideal-Theoretic Explanation of Capacity-Achieving Decoding.
22. Rigid Matrices From Rectangular PCPs or: Hard Claims Have Complex Proofs.
23. On Multilinear Forms: Bias, Correlation, and Tensor Rank.
24. On the probabilistic degree of OR over the reals.
25. List-Decoding with Double Samplers.
26. Downward Self-Reducibility in TFNP.
27. Criticality of AC0 formulae.
28. From Local to Robust Testing via Agreement Testing.
29. Improved 3LIN Hardness via Linear Label Cover.
30. Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract].
31. List Decoding with Double Samplers.
32. A Characterization of Hard-to-Cover CSPs.
33. On the Probabilistic Degree of OR over the Reals.
34. Boolean Function Analysis on High-Dimensional Expanders.
35. Mixing of 3-term progressions in Quasirandom Groups.
36. Algorithmizing the Multiplicity Schwartz-Zippel Lemma.
37. On polynomial approximations to AC.
38. Robust Multiplication-Based Tests for Reed-Muller Codes.
39. On Polynomial Approximations Over Z/2^kZ*.
40. Multiplayer Parallel Repetition for Expanding Games.
41. Locally testable codes via high-dimensional expanders.
42. Explicit SoS lower bounds from high-dimensional expanders.
43. Decoding Multivariate Multiplicity Codes on Product Sets.
44. Rigid Matrices From Rectangular PCPs.
45. COVID-19 Epidemic Study II: Phased Emergence From the Lockdown in Mumbai.
46. A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet.
47. City-Scale Agent-Based Simulators for the Study of Non-Pharmaceutical Interventions in the Context of the COVID-19 Epidemic.
48. Explicit and structured sum of squares lower bounds from high dimensional expanders.
49. Partition Bound Is Quadratically Tight for Product Distributions.
50. Robust Multiplication-Based Tests for Reed-Muller Codes.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.