Computing generalized convolutions faster than brute force
From MaRDI portal
Cites work
- A Contribution to the Theory of Groups of Prime-Power Order
- A faster exponential time algorithm for bin packing with a constant number of bins via additive combinatorics
- A generic convolution algorithm for join operations on tree decompositions
- A new algorithm for optimal 2-constraint satisfaction and its implications
- Abstract theory of inversion of finite series.
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max
- Clifford algebras meet tree decompositions
- Counting Paths and Packings in Halves
- Covering and packing in linear space
- Deterministic APSP, Orthogonal Vectors, and More
- Discriminantal subset convolution: refining exterior-algebraic methods for parameterized algorithms
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Exact and approximate bandwidth
- Explicit bounds for primes in arithmetic progressions
- Fast Algorithms for Join Operations on Tree Decompositions
- Fast generalized DFTs for all finite groups
- Fast generalized Fourier transforms
- Fast Zeta Transforms for Lattices with Few Irreducibles
- Faster minimization of tardy processing time on a single machine
- Fourier meets M\"{o}bius: fast subset convolution
- Hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space
- scientific article; zbMATH DE number 3852384 (Why is no real title available?)
- scientific article; zbMATH DE number 7204473 (Why is no real title available?)
- scientific article; zbMATH DE number 3412692 (Why is no real title available?)
- scientific article; zbMATH DE number 7650914 (Why is no real title available?)
- scientific article; zbMATH DE number 7650401 (Why is no real title available?)
- scientific article; zbMATH DE number 7788370 (Why is no real title available?)
- Improving Schroeppel and Shamir’s algorithm for subset sum via orthogonal vectors
- More applications of the polynomial method to algorithm design
- On problems equivalent to \((\min,+)\)-convolution
- On some fine-grained questions in algorithms and complexity
- Recent progress and applications in group FFTs
- Reducing \textsf{3SUM} to \textsf{Convolution-3SUM}
- Set partitioning via inclusion-exclusion
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- The parity of directed Hamiltonian cycles
This page was built for publication: Computing generalized convolutions faster than brute force
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969000)
