64 results on '"Kewen Wu"'
Search Results
2. Tight Characterizations for Preprocessing Against Cryptographic Salting.
3. Locality Bounds for Sampling Hamming Slices.
4. The Power of Adaptivity in Quantum Query Algorithms.
5. Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis.
6. I-PHYRE: Interactive Physical Reasoning.
7. On Differentially Private Counting on Trees.
8. Fourier Growth of Communication Protocols for XOR Functions.
9. Improved Bounds for Sampling Solutions of Random CNF Formulas.
10. Locally Sampleable Uniform Symmetric Distributions.
11. Locally Sampleable Uniform Symmetric Distributions.
12. GenAI-Bench: Evaluating and Improving Compositional Text-to-Visual Generation.
13. Locality Bounds for Sampling Hamming Slices.
14. Tight Characterizations for Preprocessing against Cryptographic Salting.
15. Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH.
16. Locality Bounds for Sampling Hamming Slices.
17. Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH.
18. Tight Characterizations for Preprocessing against Cryptographic Salting.
19. On the relationship between energy complexity and other boolean function measures.
20. The Power of Adaptivity in Quantum Query Algorithms.
21. I-PHYRE: Interactive Physical Reasoning.
22. Parameterized Inapproximability Hypothesis under ETH.
23. Fourier Growth of Communication Protocols for XOR Functions.
24. Parameterized Inapproximability Hypothesis under ETH.
25. Fourier Growth of Parity Decision Trees.
26. An Improved Sketching Algorithm for Edit Distance.
27. On the Learning Mechanisms in Physical Reasoning.
28. On the Degree of Boolean Functions as Polynomials over ℤm.
29. Improved bounds for the sunflower lemma.
30. Decision list compression by mild random restrictions.
31. Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis.
32. Decision List Compression by Mild Random Restrictions.
33. Improved Bounds for Sampling Solutions of Random CNF Formulas.
34. On Differentially Private Counting on Trees.
35. On the Learning Mechanisms in Physical Reasoning.
36. On the Relationship Between Energy Complexity and Other Boolean Function Measures.
37. Structured Decomposition for Reversible Boolean Functions.
38. Extracting Entities and Relations with Joint Minimum Risk Training.
39. Fourier Growth of Parity Decision Trees.
40. Perfect Sampling for (Atomic) Lovász Local Lemma.
41. Fourier Growth of Parity Decision Trees.
42. An Improved Sketching Bound for Edit Distance.
43. Understanding users' intention to switch personal cloud storage services: Evidence from the Chinese market.
44. Exploiting the Use of Wikis to Support Collaborative Writing: A Case Study of an Undergraduate Computer Science Class.
45. On the Degree of Boolean Functions as Polynomials over Zm.
46. A Note on Lower Digits Extraction Polynomial for Bootstrapping.
47. Decision list compression by mild random restrictions.
48. Improved bounds for the sunflower lemma.
49. Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis.
50. Decision list compression by mild random restrictions.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.