pith. sign in

Definition 11(Biclique Reduction).Let R = (B, A, E, p)be a PRN and( X, Y )a coherent biclique with edge set EX,Y

for everyy∈Y∩Bandx 1, x2 ∈X, we havep(x 1, y) =p(x 2, y)

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

1 Pith paper citing it
browse 1 citing papers

fields

cs.CC 1

years

2026 1

verdicts

ACCEPT 1

representative citing papers

Automated Reencoding Meets Graph Theory

cs.CC · 2026-03-29 · accept · novelty 8.0

Graph theory characterizes BVA reencodings, proving any 2-CNF on n variables can be reduced to roughly 0.396 n²/lg n clauses with minor extra steps and that at-most-one needs at least 3n-6 clauses.

citing papers explorer

Showing 1 of 1 citing paper.

  • Automated Reencoding Meets Graph Theory cs.CC · 2026-03-29 · accept · none · ref 28

    Graph theory characterizes BVA reencodings, proving any 2-CNF on n variables can be reduced to roughly 0.396 n²/lg n clauses with minor extra steps and that at-most-one needs at least 3n-6 clauses.