A robust version of Hegedus’s lemma, with applications

DOI10.1145/3357713.3384328MaRDI QIDQ5145018zbMATH OpenOpenAlexFDO

Authors Srikanth Srinivasan

Publication date 19 January 2021

Published in Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2202.04982

zbMATH Keywords

symmetric functionspolynomial methodpolynomial approximationscoin problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(1)

• \(L\)-balancing families

This page was built for publication: A robust version of Hegedus’s lemma, with applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145018)