Publications

4 results for Prasad Raghavendra

Computational limits for Matrix Completion
- - Moritz Hardt
  - Raghu Meka
  - et al.
- 2014
- JMLR
Agnostic learning of monomials by halfspaces is hard
- - Vitaly Feldman
  - Venkatesan Guruswami
  - et al.
- 2012
- SIAM Journal on Computing
Agnostic learning of monomials by halfspaces is hard
- - Vitaly Feldman
  - Venkatesan Guruswami
  - et al.
- 2009
- FOCS 2009
On the communication complexity of read-once AC ^O formulae
- - T.S. Jayram
  - Swastik Kopparty
  - et al.
- 2009
- CCC 2009