scientific article; zbMATH DE number 7051290
From MaRDI portal
Publication:4633934
zbMath1422.68101MaRDI QIDQ4633934
Moritz Hardt, Boaz Barak, Satyen Kale
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496899
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60)
Related Items (4)
Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy ⋮ A tight computational indistinguishability bound for product distributions ⋮ A complete characterization of statistical query learning with applications to evolvability ⋮ Amplifying the security of functional encryption, unconditionally
This page was built for publication:
