A new hierarchical splitting scheme recovers random 3-uniform hypergraphs with O(m log n) queries and O(m^{5/3} log n) decoding time for θ > 2/3.
International Workshop on Graph-Theoretic Concepts in Computer Science , pages=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
A Fast Hierarchical Splitting Approach for Non-Adaptive Learning of Random Hypergraphs
A new hierarchical splitting scheme recovers random 3-uniform hypergraphs with O(m log n) queries and O(m^{5/3} log n) decoding time for θ > 2/3.