Search
Filters
97 results for "Computational Complexity"
97 results for "Computational Complexity"
Computer Science 125: Algorithms & Complexity
Computer Science 125: Algorithms & Complexity
Computer Science 125: Algorithms & Complexity
Computer Science 125: Algorithms & Complexity
The computational complexity of Nash equilibria in concisely represented games
Version History: Preliminary versions as ECCC TOR05-52 (https://eccc.weizmann.ac.il/report/2005/052/; attached as ECCC2005.pdf) and in EC '06 (https://dl.acm.org/doi/10.1145/1134707.1134737; attached as EC2006.pdf).
Games may be represented in many...
CS 125: Algorithms and Complexity (Fall 2014)
The complexity of computing the optimal composition of differential privacy
Version History: Full version posted on CoRR, abs/1507.03113, July 2015. Additional version published in Proceedings of the 13th IACR Theory of Cryptography Conference (TCC '16-A).
In the study of differential privacy, composition theorems (starting...
Amplifying collision-resistance: A complexity-theoretic treatment
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functions into strongly collision-resistant ones in the standard model of...
The Complexity of Differential Privacy
Version History:
August 2016: Manuscript v1 (see files attached)
March 2017: Manuscript v2 (see files attached); Errata
April 2017: Published Version (in Tutorials on the Foundations of Cryptography; see Publisher's Version link and also SPRINGER 2017...
Interactive proofs of proximity: delegating computation in sublinear time
We study interactive proofs with sublinear-time verifiers. These proof systems can be used to ensure approximate correctness for the results of computations delegated to an untrusted server. Following the literature on property testing, we seek proof...
Complexity-theoretic implications of multicalibration
Version History:
Preliminary version posted as CoRR:abs/2312.17223.
We present connections between the recent literature on multigroup fairness for prediction algorithms and classical results in computational complexity. Multiaccurate predictors are...