Entity usage

Showing below up to 50 results in range #1 to #50.

1. Beyond the low-degree algorithm: mixtures of subcubes and their applications: Label: en
2. Competitively chasing convex bodies: Label: en
3. Private PAC learning implies finite Littlestone dimension: Label: en
4. Non-Gaussian component analysis using entropy methods: Label: en
5. Learning restricted Boltzmann machines via influence maximization: Label: en
6. Capacity lower bound for the Ising perceptron: Label: en
7. Degree-𝑑 chow parameters robustly determine degree-𝑑 PTFs (and algorithmic applications): Label: en
8. Communication complexity of estimating correlations: Label: en
9. Efficient profile maximum likelihood for universal symmetric property estimation: Label: en
10. Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions: Label: en
11. String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure: Label: en
12. Local decodability of the Burrows-Wheeler transform: Label: en
13. Computing quartet distance is equivalent to counting 4-cycles: Label: en
14. Optimal sequence length requirements for phylogenetic tree reconstruction with indels: Label: en
15. 1+ ε approximation of tree edit distance in quadratic time: Label: en
16. Near-linear time insertion-deletion codes and (1+ ε )-approximating edit distance via indexing: Label: en
17. Optimal (and benchmark-optimal) competition complexity for additive buyers over independent items: Label: en
18. Tight approximation ratio of anonymous pricing: Label: en
19. Settling the sample complexity of single-parameter revenue maximization: Label: en
20. The communication complexity of local search: Label: en
21. The complexity of splitting necklaces and bisecting ham sandwiches: Label: en
22. Pseudorandom generators for width-3 branching programs: Label: en
23. Fooling polytopes: Label: en
24. Algebraic approach to promise constraint satisfaction: Label: en
25. CSPs with global modular constraints: algorithms and hardness via polynomial representations: Label: en
26. Faster k -SAT algorithms using biased-PPSZ: Label: en
27. Bridging between 0/1 and linear programming via random walks: Label: en
28. Testing unateness nearly optimally: Label: en
29. Testing graphs in vertex-distribution-free models: Label: en
30. Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits: Label: en
31. Quantum state certification: Label: en
32. Hamiltonian simulation with nearly optimal dependence on spectral norm: Label: en
33. Good approximate quantum LDPC codes from spacetime circuit Hamiltonians: Label: en
34. Quantum proof systems for iterated exponential time, and beyond: Label: en
35. Quantum Lovász local lemma: Shearer’s bound is tight: Label: en
36. DNF sparsification beyond sunflowers: Label: en
37. A fixed-depth size-hierarchy theorem for AC ⁰ [⊕] via the coin problem: Label: en
38. On the approximation resistance of balanced linear threshold functions: Label: en
39. Separating monotone VP and VNP: Label: en
40. Reconstruction of non-degenerate homogeneous depth three circuits: Label: en
41. Near-optimal lower bounds on the threshold degree and sign-rank of AC ⁰: Label: en
42. A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems: Label: en
43. Dynamic low-stretch trees via dynamic low-diameter decompositions: Label: en
44. Decremental strongly-connected components and single-source reachability in near-linear time: Label: en
45. Towards the locality of Vizing’s theorem: Label: en
46. Distributed edge connectivity in sublinear time: Label: en
47. Distributed exact weighted all-pairs shortest paths in near-linear time: Label: en
48. Gentle measurement of quantum states and differential privacy: Label: en
49. The structure of optimal private tests for simple hypotheses: Label: en
50. Private selection from private candidates: Label: en