Clifford algebras meet tree decompositions
type: Item
instance of: scholarly article
title: Clifford algebras meet tree decompositions
zbMATH Open document ID: 1416.05145
author: Michał Włodarczyk
published in: Algorithmica
publication date: 2019-02-14T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 15A66
Mathematics Subject Classification ID: 11E88
zbMATH DE Number: 7023724
zbMATH Keywords: non-commutative subset convolution
describes a project that uses: GluCat
MaRDI profile type: Publication
Wikidata QID: Q92373090
full work available at URL: s00453-018-0489-3
OpenAlex ID: W2525537616
cites work: Q4243485
cites work: Fourier meets M\"{o}bius: fast subset convolution
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
cites work: Q4857168
cites work: A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank
cites work: Fast Hamiltonicity Checking Via Bases of Perfect Matchings
cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
cites work: Representative Sets of Product Families
cites work: Treewidth. Computations and approximations
cites work: A generalized FFT for Clifford algebras
cites work: Q4335301
cites work: Graph minors. III. Planar tree-width
cites work: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
cites work: Multiplying matrices faster than coppersmith-winograd
DBLP publication ID: journals/algorithmica/Wlodarczyk19
DOI: 10.1007/S00453-018-0489-3
description: scientific article; zbMATH DE number 7023724