On the complexity of random satisfiability problems with planted solutions
- Vitaly Feldman
- Will Perkins
- et al.
- 2015
- STOC 2015
Publications
This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.
Date
Featured collections
Popular topics
3 results at STOC 2015
Tight bounds for learning a mixture of two gaussians
- Moritz Hardt
- Eric Price
- 2015
- STOC 2015
Preserving statistical validity in adaptive data analysis
- Cynthia Dwork
- Vitaly Feldman
- et al.
- 2015
- STOC 2015