Extensor-coding

DOI10.1145/3188745.3188902zbMath1427.05217arXiv1804.09448OpenAlexW2798555189MaRDI QIDQ5230285

Cornelius Brand, Thore Husfeldt, Holger Dell

Publication date: 22 August 2019

Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

exterior algebra\(k\)-pathapproximate counting

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Enumeration in graph theory (05C30) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Exterior algebra, Grassmann algebras (15A75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (10)

A note on algebraic techniques for subgraph detection ⋮ Fast exact algorithms using Hadamard product of polynomials ⋮ Discriminantal subset convolution: refining exterior-algebraic methods for parameterized algorithms ⋮ Parameterised counting in logspace ⋮ Parameterized Counting and Cayley Graph Expanders ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Approximate Counting of k-Paths: Deterministic and in Polynomial Space ⋮ Univariate ideal membership parameterized by rank, degree, and number of generators

This page was built for publication: Extensor-coding