Internal Program Activities Breadcrumb Home Programs & Events Internal Activities Upcoming Past View Events by Program - All - View Events by Program No Internal Activities yet. View Events by Program - All -Lower Bounds in Computational ComplexityFoundations of Data Science View Events by Program Monotone real circuits and real protocols Monotone real circuits and real protocols Lower Bounds in Computational Complexity Pavel Pudlák Is Q-learning Provably Efficient? Is Q-learning Provably Efficient? Foundations of Data Science Chi Jin Resolving the sample complexity of learning mixtures of Gaussians Resolving the sample complexity of learning mixtures of Gaussians Foundations of Data Science Shai Ben-David Pathset formula lower bounds for st-connectivity Pathset formula lower bounds for st-connectivity Lower Bounds in Computational Complexity Benjamin Rossman Distributed Property Testing Distributed Property Testing Lower Bounds in Computational Complexity Rotem Othman Language Edit Distance, (min,+)-Matrix Multiplication & Beyond Language Edit Distance, (min,+)-Matrix Multiplication & Beyond Foundations of Data Science Barna Saha The Approximate Degree of Surjectivity: How the Sausage is Made The Approximate Degree of Surjectivity: How the Sausage is Made Lower Bounds in Computational Complexity Mark Bun A Near-Optimal Depth-Hierarchy theorem for Small-Depth Multilinear Circuits A Near-Optimal Depth-Hierarchy theorem for Small-Depth Multilinear Circuits Lower Bounds in Computational Complexity Srikanth Srinivasan (IIT Bombay) Dynamic Incentive-aware Learning: Robust Pricing in Contextual Auctions Dynamic Incentive-aware Learning: Robust Pricing in Contextual Auctions Foundations of Data Science Adel Javanmard, USC 5 Minute Madness 5 Minute Madness Foundations of Data Science Pagination First page First Previous page Previous Page 100 Page 101 Current page 102 Page 103 Page 104 Next page Next Last page Last
