Limits of preprocessing
From MaRDI portal
Recommendations
- Constant depth circuits, Fourier transform, and learnability
- \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product
- Secure computation with preprocessing via function secret sharing
- Pseudorandom functions in \(\text{TC}^0\) and cryptographic limitations to proving lower bounds
- Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution
Cites work
- scientific article; zbMATH DE number 3133919 (Why is no real title available?)
- scientific article; zbMATH DE number 7561745 (Why is no real title available?)
- Communication Complexity of Simultaneous Messages
- Efficient noise-tolerant learning from statistical queries
- Entropy and information theory.
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Extractors for Circuit Sources
- From average case complexity to improper learning complexity
- Graph complexity
- How to compute under \({\mathcal{AC}}^{0}\) leakage without secure hardware
- On a theorem of Razborov
- On the Correlation of Parity and Small-Depth Circuits
- On the randomness complexity of efficient sampling
- PAC learning depth-3 \(\mathrm{AC}^0\) circuits of bounded top fanin
- Probabilistic rank and matrix rigidity
- Pseudorandom functions and lattices
- Pseudorandom functions: three decades later
- The landscape of communication complexity classes
- Tight bounds on the Fourier spectrum of \(\mathsf{AC}^0\)
- Unconditionally secure computation against low-complexity leakage
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis
- \(\mathrm{AC}^0\circ\mathrm{MOD}_2\) lower bounds for the Boolean inner product
This page was built for publication: Limits of preprocessing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6581870)
