
TL;DR
This paper explores the Waring rank's application to algorithms, introducing new methods for approximate counting and decision problems, and demonstrates their effectiveness through improved algorithms for subgraph counting and algebraic problems.
Contribution
It establishes a novel connection between Waring rank and algorithm design, leading to faster approximate algorithms and solutions to open problems in algebraic complexity and combinatorics.
Findings
Developed a randomized algorithm with runtime $4.075^d \, poly(n, \, ext{epsilon}^{-1})$ for approximate coefficient sum.
Improved algorithms for counting subgraphs of bounded treewidth.
Provided an exact solution to an open problem of Koutis and Williams.
Abstract
Given nonnegative integers and , where , what is the minimum number such that there exist linear forms so that is supported exactly on the set of all degree- multilinear monomials in ? We show that this and related questions have surprising and intimate connections to the areas of parameterized and exact algorithms, generalizing several well-known methods and providing a concrete approach to obtain faster approximate counting and deterministic decision algorithms. This gives a new application of Waring rank, a classical topic in algebraic geometry with connections to algebraic complexity theory, to computer science. To illustrate the amenability and utility of this approach, we give a randomized -time…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
