Pages that link to "Item:Q5495806"
From MaRDI portal
The following pages link to Answering n <sub>{2+o(1)}</sub> counting queries with differential privacy is hard (Q5495806):
Displaying 4 items.
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS (Q2971052) (← links)
- Infinite randomness expansion with a constant number of devices (Q5259577) (← links)
- Optimal error rates for interactive coding I (Q5259615) (← links)
