Entity usage

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

1. Multicommodity flows and cuts in polymatroidal networks: Label: en
2. Quantum rejection sampling: Label: en
3. Marginal hitting sets imply super-polynomial lower bounds for permanent: Label: en
4. Linear programming, width-1 CSPs, and robust satisfaction: Label: en
5. On beating the hybrid argument: Label: en
6. Gadgets and anti-gadgets leading to a complexity dichotomy: Label: en
7. Compressed matrix multiplication: Label: en
8. On persistent homotopy, knotted complexes and the Alexander module: Label: en
9. On the degree of univariate polynomials over the integers: Label: en
10. Spectral sparsification via random spanners: Label: en
11. Graph densification: Label: en
12. Sherali-Adams relaxations and indistinguishability in counting logics: Label: en
13. Targeted malleability: Label: en
14. From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again: Label: en
15. (Leveled) fully homomorphic encryption without bootstrapping: Label: en
16. Quantum money from knots: Label: en
17. Quantum interactive proofs with weak error bounds: Label: en
18. Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure: Label: en
19. Crowdsourced Bayesian auctions: Label: en
20. Dynamics of prisoner's dilemma and the evolution of cooperation on networks: Label: en
21. Fairness through awareness: Label: en
22. Approximately optimal mechanism design via differential privacy: Label: en
23. Bounds on locally testable codes with unique tests: Label: en
24. List decoding subspace codes from insertions and deletions: Label: en
25. Linear time decoding of regular expander codes: Label: en
26. Towards deterministic tree code constructions: Label: en
27. Algorithms on evolving graphs: Label: en
28. Distribution free evolvability of polynomial functions over all convex loss functions: Label: en
29. Noise vs computational intractability in dynamics: Label: en
30. Paging for multi-core shared caches: Label: en
31. Practical verified computation with streaming interactive proofs: Label: en
32. From randomizing polynomials to parallel algorithms: Label: en
33. No justified complaints: Label: en
34. The curse of simultaneity: Label: en
35. Quantum strategic game theory: Label: en
36. Mechanism design with approximate valuations: Label: en
37. Restriction access: Label: en
38. Learning hurdles for sleeping experts: Label: en
39. High-confidence predictions under adversarial uncertainty: Label: en