Higher cell probe lower bounds for evaluating polynomials

DOI10.1109/FOCS.2012.21MaRDI QIDQ6988218zbMATH OpenFDO

Authors Kasper Green Larsen

Publication date 5 May 2025

Full work available at URL https://doi.org/10.1109/FOCS.2012.21

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(3)

• Time/space tradeoffs for generic attacks on delay functions
• From tcs to learning theory (invited paper)
• Super-logarithmic lower bounds for dynamic graph problems

This page was built for publication: Higher cell probe lower bounds for evaluating polynomials

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