Computational Sample Complexity

DOI10.1137/S0097539797325648zbMath0941.68108OpenAlexW1970472910MaRDI QIDQ4943849

Scott E. Decatur, Oded Goldreich, Dana Ron

Publication date: 19 March 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539797325648

zbMATH Keywords

computational learning theoryerror correcting codespseudo-random functionswire-tap channelinformation vs. efficient computation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (8)

ZK-PCPs from leakage-resilient secret sharing ⋮ High-dimensional change-point estimation: combining filtering with convex optimization ⋮ Improved, black-box, non-malleable encryption from semantic security ⋮ A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy ⋮ Unnamed Item ⋮ Fully-Simulatable Oblivious Set Transfer ⋮ A black-box construction of non-malleable encryption from semantically secure encryption ⋮ Optimal testing for planted satisfiability problems

This page was built for publication: Computational Sample Complexity