Pages that link to "Item:Q2988893"

The following pages link to Faster private release of marginals on small databases (Q2988893):

Displaying 16 items.

• The hardest halfspace (Q1983325) (← links)
• PCPs and the hardness of generating synthetic data (Q2210447) (← links)
• Efficient algorithms for privately releasing marginals via convex relaxations (Q2349860) (← links)
• Order-Revealing Encryption and the Hardness of Private Learning (Q2796125) (← links)
• Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
• An Almost-Optimally Fair Three-Party Coin-Flipping Protocol (Q2968163) (← links)
• Optimal CUR Matrix Decompositions (Q2968164) (← links)
• EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS (Q2971052) (← links)
• Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region (Q3177756) (← links)
• Communication is Bounded by Root of Rank (Q3177758) (← links)
• Are Lock-Free Concurrent Algorithms Practically Wait-Free? (Q3177807) (← links)
• Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices (Q3177810) (← links)
• The Power of Localization for Efficiently Learning Linear Separators with Noise (Q3177877) (← links)
• New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
• Differential Privacy on Finite Computers (Q4993311) (← links)
• Approximate Degree, Secret Sharing, and Concentration Phenomena (Q5875531) (← links)