Pith. sign in

Title resolution pending

· 2018

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

2019 1

verdicts

REJECT 1

representative citing papers

Hyperedge Estimation using Polylogarithmic Subset Queries

cs.DS · 2019-08-12 · reject · novelty 6.0

A randomized algorithm estimates m(H) within factor (1 +/- epsilon) using O_d(log^{5d+5} n / epsilon^4) GPIS queries for d-uniform hypergraphs, if the sparsification lemma is valid.

citing papers explorer

Showing 1 of 1 citing paper.

  • Hyperedge Estimation using Polylogarithmic Subset Queries cs.DS · 2019-08-12 · reject · none · ref 5

    A randomized algorithm estimates m(H) within factor (1 +/- epsilon) using O_d(log^{5d+5} n / epsilon^4) GPIS queries for d-uniform hypergraphs, if the sparsification lemma is valid.