The following pages link to Computational Sample Complexity (Q4943849):
Displaying 10 items.
- A black-box construction of non-malleable encryption from semantically secure encryption (Q1747662) (← links)
- ZK-PCPs from leakage-resilient secret sharing (Q2159466) (← links)
- Optimal testing for planted satisfiability problems (Q2259537) (← links)
- High-dimensional change-point estimation: combining filtering with convex optimization (Q2397167) (← links)
- Improved, black-box, non-malleable encryption from semantic security (Q2413015) (← links)
- Sample complexity for computational classification problems (Q2461637) (← links)
- Fully-Simulatable Oblivious Set Transfer (Q3511158) (← links)
- Computational limitations on learning from examples (Q3813320) (← links)
- Improper learning by refuting (Q4993325) (← links)
- A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy (Q5098765) (← links)