scientific article; zbMATH DE number 7561745
From MaRDI portal
Publication:5092467
DOI10.4230/LIPICS.CCC.2020.17MaRDI QIDQ5092467FDOQ5092467
Yuval Filmus, Guy Kindler, Avi Kaplan, Yuval Ishai
Publication date: 21 July 2022
Title of this publication is not available (Why is that?)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(\Sigma_ 1^ 1\)-formulae on finite structures
- Extractors for Circuit Sources
- Efficient noise-tolerant learning from statistical queries
- On the randomness complexity of efficient sampling
- Graph complexity
- On a theorem of Razborov
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis
- Pseudorandom Functions and Lattices
- Communication Complexity of Simultaneous Messages
- Pseudorandom Functions: Three Decades Later
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Candidate weak pseudorandom functions in AC 0 ○ MOD 2
- How to Compute under $${\mathcal {\varvec{AC}}}^\mathbf{0}$$ Leakage without Secure Hardware
- Unconditionally secure computation against low-complexity leakage
- Probabilistic rank and matrix rigidity
- Matrix rigidity and the Croot-Lev-Pach lemma
- From average case complexity to improper learning complexity
- AC^0 o 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)