ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2002.09130
  4. Cited By
A polynomial lower bound on adaptive complexity of submodular
  maximization

A polynomial lower bound on adaptive complexity of submodular maximization

21 February 2020
Wenzheng Li
Paul Liu
J. Vondrák
ArXivPDFHTML

Papers citing "A polynomial lower bound on adaptive complexity of submodular maximization"

Title
No papers