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. 1008.3187
  4. Cited By
Polynomial-Time Approximation Schemes for Knapsack and Related Counting
  Problems using Branching Programs

Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs

18 August 2010
Parikshit Gopalan
Adam R. Klivans
Raghu Meka
ArXivPDFHTML

Papers citing "Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs"

Title
No papers