pith. sign in

Title resolution pending

time · 1996

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DS 1

years

2024 1

verdicts

UNVERDICTED 1

representative citing papers

Redundancy Is All You Need (for CSP Sparsification)

cs.DS · 2024-11-05 · unverdicted · novelty 8.0

For any CSP predicate R, unweighted CSP(R) instances admit sparsifiers of size at most their non-redundancy (up to polylog factors); weighted cases are pinned to chain length, via a VC-type theorem for set families using the entropy method.

citing papers explorer

Showing 1 of 1 citing paper.

  • Redundancy Is All You Need (for CSP Sparsification) cs.DS · 2024-11-05 · unverdicted · none · ref 6

    For any CSP predicate R, unweighted CSP(R) instances admit sparsifiers of size at most their non-redundancy (up to polylog factors); weighted cases are pinned to chain length, via a VC-type theorem for set families using the entropy method.