Raghavendra, Prasad

Agnostic Learning of Monomials by Halfspaces Is Hard

Feldman, V., Guruswami, V., Raghavendra, P., & Wu, Y. (2012) · SIAM Journal on Computing

Complexity and Algorithms in GraphsMachine Learning and Algorithms

Cited by 143

Beating the random assignment on constraint satisfaction problems of bounded degree

Barak, B., Moitra, A., O'Donnell, R., Raghavendra, P., Regev, O., Steurer, D., Trevisan, L., Vijayaraghavan, A., Witmer, D., & Wright, J. (2015) · arXiv

Constraint Satisfaction and OptimizationComplexity and Algorithms in Graphs

Cited by 8