Waring rank, parameterized and exact algorithms

DOI10.1109/FOCS.2019.00053MaRDI QIDQ6944184zbMATH OpenFDO

Authors Kevin Pratt

Publication date 12 August 2025

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

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(6)

• A simple inclusion-exclusion based algorithm for (k, n)-MLC and related problems
• Privately constrained PRFs from DCR: puncturing and bounded Waring rank
• Parameterized applications of symbolic differentiation of (totally) multilinear polynomials
• Current algorithms for detecting subgraphs of bounded treewidth are probably optimal
• Explicit commutative ROABPs from partial derivatives
• On approximate symmetric polynomials and tightness of homogenization results

This page was built for publication: Waring rank, parameterized and exact algorithms

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