Pages that link to "Item:Q2988893"
From MaRDI portal
The following pages link to Faster private release of marginals on small databases (Q2988893):
Displaying 50 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)
- Fingerprinting Codes and the Price of Approximate Differential Privacy (Q4554072) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- Deciding First-Order Properties of Nowhere Dense Graphs (Q4640289) (← links)
- The Matching Polytope has Exponential Extension Complexity (Q4640350) (← links)
- Differential Privacy on Finite Computers (Q4993311) (← links)
- The Complexity of Differential Privacy (Q5021135) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- Fingerprinting codes and the price of approximate differential privacy (Q5259533) (← links)
- Analyze gauss (Q5259534) (← links)
- Private matchings and allocations (Q5259535) (← links)
- Rounding sum-of-squares relaxations (Q5259536) (← links)
- Constant factor approximation for balanced cut in the PIE model (Q5259537) (← links)
- Entropy, optimization and counting (Q5259538) (← links)
- Polynomial bounds for the grid-minor theorem (Q5259539) (← links)
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem (Q5259540) (← links)
- Cops, robbers, and threatening skeletons (Q5259541) (← links)
- Pseudorandom generators with optimal seed length for non-boolean poly-size circuits (Q5259543) (← links)
- On derandomizing algorithms that err extremely rarely (Q5259544) (← links)
- Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas (Q5259545) (← links)
- Lower bounds for depth 4 formulas computing iterated matrix multiplication (Q5259546) (← links)
- The limits of depth reduction for arithmetic formulas (Q5259547) (← links)
- A super-polynomial lower bound for regular arithmetic formulas (Q5259548) (← links)
- A characterization of locally testable affine-invariant properties via decomposition theorems (Q5259549) (← links)
- L <sub>p</sub> -testing (Q5259550) (← links)
- Turnstile streaming algorithms might as well be linear sketches (Q5259551) (← links)
- Linear time construction of compressed text indices in compact space (Q5259552) (← links)
- Formulas vs. circuits for small distance connectivity (Q5259554) (← links)
- Toward better formula lower bounds (Q5259555) (← links)
- Breaking the minsky-papert barrier for constant-depth circuits (Q5259556) (← links)
- Economic efficiency requires interaction (Q5259557) (← links)
- The sample complexity of revenue maximization (Q5259558) (← links)
- Optimal competitive auctions (Q5259559) (← links)
- Homological product codes (Q5259561) (← links)
- A quantum algorithm for computing the unit group of an arbitrary degree number field (Q5259563) (← links)
- Primal beats dual on online packing LPs in the random-order model (Q5259564) (← links)
