Session 1C - A polynomial lower bound on adaptive complexity of submodular maximization
Sep 19, 2020
Association for Computing Machinery (ACM)
Link to slides:
Link to paper:
Category: STOC 2020
📝 No reactions yet
Be the first one to share your thoughts!
ICAPS 2012: Session VIb on "Planning and Scheduling for Shipping and Transportation"
| Aug 18, 2014
ICAPS 2012: Awards & Best Dissertation Presentations
| Aug 19, 2014
ICAPS 2014: Miquel Ramírez on "Directed Fixed-Point Regression-Based Planning..."
| Sep 22, 2014
Representation Learning: A Review and New Perspectives
| Nov 12, 2014
Playing Atari with Deep Reinforcement Learning | Two Minute Paper
Two Minute Papers
| Mar 7, 2015
Crossminds Chrome Extension
Watch videos on arXiv
Subscribe to Our Newsletter
AI Startup Jobs
Terms & Conditions
© Provided by CrossCircles Inc.