no code implementations • 11 Jan 2024 • Karen M. Dæhli, Sarah A Obead, Hsuan-Yin Lin, Eirik Rosnes
Focusing on private \emph{quadratic monomial} computation, we propose three methods for ordering candidate functions: a graph edge-coloring method, a graph-distance method, and an entropy-based greedy method.
Information Theory Information Theory
