The authors give an Õ(n + √(wt))-time algorithm for Subset Sum.
A new proof of szemer \'e di's theorem
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Introduces joint upper Banach densities for plane sets and proves a cross-set distance realization theorem plus maximal VC dimension for families of scaled curve translates with non-vanishing curvature.
citing papers explorer
-
An Improved Pseudopolynomial Time Algorithm for Subset Sum
The authors give an Õ(n + √(wt))-time algorithm for Subset Sum.
-
Joint upper Banach density, VC dimensions and Euclidean point configurations
Introduces joint upper Banach densities for plane sets and proves a cross-set distance realization theorem plus maximal VC dimension for families of scaled curve translates with non-vanishing curvature.