Neha Pant

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2026

Finding Hypercliques Faster Than Brute Force

Josh Alman, Baitian Li, Neha Pant +2

We show that for any fixed $k$ , there exists $ε_{k} > 0$ such that, given a $(k - 1)$ -uniform hypergraph $H$ on $n$ vertices, one can count the number of $k$ -hypercliques in…

cs.DS2026

Beating Trivial Time for Tricky Triangle Tasks

Neha Pant, Ryan Williams

For several well-studied triangle detection problems in the literature, the trivial enumeration algorithms are known to be optimal (up to the exponent) assuming popular fine-graine…