LIMITS and Applications of Group Algebras for Parameterized Problems

DOI10.1145/2885499zbMath1445.68343OpenAlexW2408491755MaRDI QIDQ4962604

Ioannis Koutis, R. Ryan Williams

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2885499

zbMATH Keywords

permanentalgebraic algorithmsexact countingmultilinear detectioncolor coding

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Parameterized complexity, tractability and kernelization (68Q27) Communication complexity, information complexity (68Q11)

Related Items (16)

Four Shorts Stories on Surprising Algorithmic Uses of Treewidth ⋮ Fast exact algorithms using Hadamard product of polynomials ⋮ Unnamed Item ⋮ Application of group ring algebra to localized and delocalized quantum states in periodic potentials ⋮ Detours in directed graphs ⋮ Balanced substructures in bicolored graphs ⋮ Parameterized Dynamic Variants of Red-Blue Dominating Set ⋮ Clearing directed subgraphs by mobile agents. Variations on covering with paths ⋮ Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Approximate Counting of k-Paths: Deterministic and in Polynomial Space ⋮ Decomposition of Map Graphs with Applications. ⋮ Univariate ideal membership parameterized by rank, degree, and number of generators

This page was built for publication: LIMITS and Applications of Group Algebras for Parameterized Problems