Query-efficient algorithms for polynomial interpolation over composites

DOI10.1145/1109557.1109657MaRDI QIDQ3581556zbMATH OpenOpenAlexFDO

Authors Parikshit Gopalan

Publication date 16 August 2010

Published in Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1109557.1109657

Mathematics Subject Classification ID

Solving polynomial systems; resultants (13P15) Computational learning theory (68Q32)

Cited in

(2)

• Constructing Ramsey graphs from Boolean function representations
• On the modulo degree complexity of Boolean functions

This page was built for publication: Query-efficient algorithms for polynomial interpolation over composites

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