Proves 2^Ω(r) lower bounds for dag-like Res(lin_F_q) refutations of (s,r)-robust Subset Sum instances and 2^Ω(((q+1)ln q)^{-1/3} d^{1/5}) for tree-like refutations, where d is the code minimum distance.
The complexity of the pigeonhole princip le
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Lower Bounds for Subset Sum in Resolution with Modular Counting
Proves 2^Ω(r) lower bounds for dag-like Res(lin_F_q) refutations of (s,r)-robust Subset Sum instances and 2^Ω(((q+1)ln q)^{-1/3} d^{1/5}) for tree-like refutations, where d is the code minimum distance.