Title resolution pending

Peter W · 1991 · DOI 10.1090/dimacs/004/41

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

1 Pith paper citing it

open at publisher 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.

representative citing papers

Implicit representations via the polynomial method

cs.CG · 2026-02-11 · unverdicted · novelty 7.0

Semialgebraic graphs admit O(n^{1-2/(d+1)+ε})-bit adjacency labels via polynomial partitioning; semilinear graphs need only O(log n) bits.

citing papers explorer

Showing 1 of 1 citing paper.

Implicit representations via the polynomial method cs.CG · 2026-02-11 · unverdicted · none · ref 78
Semialgebraic graphs admit O(n^{1-2/(d+1)+ε})-bit adjacency labels via polynomial partitioning; semilinear graphs need only O(log n) bits.

Title resolution pending

fields

years

verdicts

representative citing papers

citing papers explorer