arXiv (OAI Expanded)
open access
Differential Privacy Meets Fixed Parameter Tractability: Algorithms and Lower Bounds
We study combinatorial optimization problems under the constraint of $ε$-differential privacy ($ε$-DP). Given the strong lower bounds for explicitly outputting solutions, we work within the implicit representation framework of Gupta et al. (SODA 2010), where a private polynomial-time randomized "enc
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Improved Lower Bounds for Privacy under Continual Release#471918
- Improved lower bounds for privacy under continual release#405955
- Differentially Private Approximation of the John Ellipsoid#1116937
- Privacy as Protection of the Incomputable Self: From Agnostic to Agonistic Machine Learning#400227
- Private Direct Preference Optimization for LLM Alignment#429257
Record · ID 1070005
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive