Computer Science – Computational Complexity
Scientist
Computer Science
Computational Complexity
Scientist
University of Washington
Agnostic Learning of Monomials by Halfspaces is Hard
Approximating CSPs with Global Cardinality Constraints Using SDP Hierarchies
Approximating Sparsest Cut in Graphs of Bounded Treewidth
Average sensitivity and noise sensitivity of polynomial threshold functions
Coarse differentiation and multi-flows in planar graphs
No associations
LandOfFree
Prasad Raghavendra does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Prasad Raghavendra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Prasad Raghavendra will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-241703