Fast Exact Algorithms Using Hadamard Product of Polynomials

DOI10.4230/LIPICS.FSTTCS.2019.9OpenAlexW2998059440MaRDI QIDQ5875641FDOQ5875641

Authors: Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay 

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/abs/1807.04496

Recommendations

• Fast exact algorithms using Hadamard product of polynomials
• Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum
• LIMITS and applications of group algebras for parameterized problems
• Arithmetic circuits and the Hadamard product of polynomials
• Algorithms for testing monomials in multivariate polynomials

zbMATH Keywords

Hadamard productsymmetric polynomialrectangular permanentmultilinear monomial detection and counting

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cited In (4)

• On fast multiplication of polynomials over arbitrary algebras
• Arithmetic circuits and the Hadamard product of polynomials
• Limits and Applications of Group Algebras for Parameterized Problems
• Fast algorithms for the characteristic polynomial

This page was built for publication: Fast Exact Algorithms Using Hadamard Product of Polynomials

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