New lower bounds on g_3(n) via central trinomial coefficients and general exponential lower bounds for g_k(n) (k≥4), paired with upper exponential rates from digit constructions on nearly-regular graphs.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
The authors give an Õ(n + √(wt))-time algorithm for Subset Sum.
citing papers explorer
-
Arithmetic Progression-Free Subset-Sum Sets
New lower bounds on g_3(n) via central trinomial coefficients and general exponential lower bounds for g_k(n) (k≥4), paired with upper exponential rates from digit constructions on nearly-regular graphs.
-
An Improved Pseudopolynomial Time Algorithm for Subset Sum
The authors give an Õ(n + √(wt))-time algorithm for Subset Sum.