scientific article; zbMATH DE number 7561745
From MaRDI portal
Publication:5092467
Cites work
- scientific article; zbMATH DE number 3133919 (Why is no real title available?)
- Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
- Communication Complexity of Simultaneous Messages
- Efficient noise-tolerant learning from statistical queries
- 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
- Matrix rigidity and the Croot-Lev-Pach lemma
- On a theorem of Razborov
- 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
- 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
- \(\Sigma_ 1^ 1\)-formulae on finite structures
- \(\mathrm{AC}^0\circ\mathrm{MOD}_2\) lower bounds for the Boolean inner product
Cited in
(5)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092467)
