pith. sign in

Title resolution pending

Daniel J · 1966

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.DM 1

years

2025 1

verdicts

UNVERDICTED 1

representative citing papers

CNFs and DNFs with Exactly $k$ Solutions

cs.DM · 2025-06-08 · unverdicted · novelty 7.0

Authors establish O(sqrt(log k) log log k) upper bound on terms for monotone DNF with exactly k solutions and Omega(log log k) lower bound for DNF/CNF on infinitely many k.

citing papers explorer

Showing 1 of 1 citing paper.

  • CNFs and DNFs with Exactly $k$ Solutions cs.DM · 2025-06-08 · unverdicted · none · ref 12

    Authors establish O(sqrt(log k) log log k) upper bound on terms for monotone DNF with exactly k solutions and Omega(log log k) lower bound for DNF/CNF on infinitely many k.