Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum
From MaRDI portal
Publication:3087940
Recommendations
- Kernelizations for Parameterized Counting Problems
- Top-𝑘-convolution and the quest for near-linear output-sensitive subset sum
- Fast monotone summation over disjoint sets
- Fast Monotone Summation over Disjoint Sets
- On Multidimensional and Monotone k-SUM
- An inductive-style procedure for counting monochromatic simplexes of symmetric subdivisions with applications to distributed computing
- Discriminantal subset convolution: refining exterior-algebraic methods for parameterized algorithms
- Monomials in arithmetic circuits: complete problems in the counting hierarchy
- Monomials in arithmetic circuits: complete problems in the counting hierarchy
- Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors
Cited in
(7)- Fast exact algorithms using Hadamard product of polynomials
- LIMITS and applications of group algebras for parameterized problems
- Parameterized counting matching and packing: a family of hard problems that admit FPTRAS
- Top-𝑘-convolution and the quest for near-linear output-sensitive subset sum
- Fast Exact Algorithms Using Hadamard Product of Polynomials
- On Counting Parameterized Matching and Packing
- Limits and Applications of Group Algebras for Parameterized Problems
This page was built for publication: Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087940)