Fast exact algorithms using Hadamard product of polynomials
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3461412 (Why is no real title available?)
- scientific article; zbMATH DE number 1261512 (Why is no real title available?)
- scientific article; zbMATH DE number 1261820 (Why is no real title available?)
- scientific article; zbMATH DE number 1332669 (Why is no real title available?)
- A probabilistic remark on algebraic program testing
- Algorithm engineering for color-coding with applications to signaling pathway detection
- Approximately counting and sampling small witnesses using a colourful decision oracle
- Arithmetic circuits and the Hadamard product of polynomials
- Arithmetic circuits: a survey of recent results and open questions
- Color-coding
- Counting Paths and Packings in Halves
- Counting solutions to polynomial systems via reductions
- Deterministic polynomial identity testing in non-commutative models
- Diagonal Circuit Identity Testing and Lower Bounds
- Evaluation of permanents in rings and semirings
- Extensor-coding
- Fast Parallel Computation of Polynomials Using Few Processors
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Faster Algebraic Algorithms for Path and Packing Problems
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Fine-grained reductions from approximate counting to decision
- Fundamentals of parameterized complexity
- Integer multiplication in time \(O(n\log n)\)
- LIMITS and applications of group algebras for parameterized problems
- Modern computer algebra
- On the hardness of the noncommutative determinant
- On the hardness of the noncommutative determinant
- Parameterized algorithms
- Sums of Like Powers of Multivariate Linear Forms
- The polynomial method in circuit complexity applied to algorithm design (invited talk)
Cited in
(7)- On fast multiplication of polynomials over arbitrary algebras
- LIMITS and applications of group algebras for parameterized problems
- A simple inclusion-exclusion based algorithm for (k, n)-MLC and related problems
- Arithmetic circuits and the Hadamard product of polynomials
- Fast Exact Algorithms Using 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 Q832524)
