145 results on '"Avishay Tal"'
Search Results
2. Rigid Matrices from Rectangular PCPs.
3. New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs.
4. Fourier Growth of Communication Protocols for XOR Functions.
5. Tight Time-Space Lower Bounds for Constant-Pass Learning.
6. Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting.
7. Quantum Cryptography in Algorithmica.
8. Depth-d Threshold Circuits vs. Depth-(d+1) AND-OR Trees.
9. Quantum-Computable One-Way Functions without One-Way Functions.
10. Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC0.
11. Guest Editors' Foreword to the CCC 2020 Special Issue.
12. Oracle Separation of BQP and PH.
13. The Power of Adaptivity in Quantum Query Algorithms.
14. Junta Distance Approximation with Sub-Exponential Queries.
15. Fourier Growth of Parity Decision Trees.
16. Fooling Constant-Depth Threshold Circuits (Extended Abstract).
17. Degree vs. approximate degree and Quantum implications of Huang's sensitivity theorem.
18. Shrinkage Under Random Projections, and Cubic Formula Lower Bounds for AC0 (Extended Abstract).
19. Quantum Versus Randomized Communication Complexity, with Efficient Players.
20. Pseudorandom Generators for Read-Once Monotone Branching Programs.
21. Rigid Matrices From Rectangular PCPs or: Hard Claims Have Complex Proofs.
22. Towards Optimal Separations between Quantum and Randomized Query Complexities.
23. On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions.
24. Quantum Cryptography in Algorithmica.
25. Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees.
26. AC0[p] Lower Bounds Against MCSP via the Coin Problem.
27. Time-Space Lower Bounds for Two-Pass Learning.
28. Oracle separation of BQP and PH.
29. Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits.
30. Pseudorandom generators for width-3 branching programs.
31. On the Computational Power of Radio Channels.
32. Cubic Formula Size Lower Bounds Based on Compositions with Majority.
33. Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates.
34. Extractor-based time-space lower bounds for learning.
35. Improved pseudorandomness for unordered branching programs through local monotonicity.
36. Pseudorandom Generators for Low Sensitivity Functions.
37. The Robust Sensitivity of Boolean Functions.
38. Monotone Branching Programs: Pseudorandomness and Circuit Complexity.
39. Fooling Constant-Depth Threshold Circuits.
40. Quantum versus Randomized Communication Complexity, with Efficient Players.
41. Tight Bounds on the Fourier Spectrum of AC0.
42. Formula lower bounds via the quantum method.
43. Time-space hardness of learning sparse parities.
44. Low-Sensitivity Functions from Unambiguous Certificates.
45. Lower Bounds for 2-Query LCCs over Large Alphabet.
46. The choice and agreement problems of a random function.
47. Matrix rigidity of random Toeplitz matrices.
48. Quantum Implications of Huang's Sensitivity Theorem.
49. Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC0.
50. Degree vs. Approximate Degree and Quantum Implications of Huang's Sensitivity Theorem.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.