activity
20102026
most citedPolynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs

24 citations · 45 across the 15 of their papers we have counts for

collaborators
Showing cs.AIShow all

Nothing from them under that filter.

Their other years and fields are still on the left.