research
∙
05/08/2023
Count on CFI graphs for #P-hardness
Given graphs H and G, possibly with vertex-colors, a homomorphism is a f...
share
research
∙
04/22/2022
Determinants from homomorphisms
We give a new combinatorial explanation for well-known relations between...
research
∙
08/29/2021
Parameterizing the Permanent: Hardness for K_8-minor-free graphs
In the 1960s, statistical physicists discovered a fascinating algorithm ...
research
∙
07/01/2021
Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths
We systematically investigate the complexity of counting subgraph patter...
research
∙
02/08/2021
A full complexity dichotomy for immanant families
Given an integer n≥ 1 and an irreducible character χ_λ of S_n for some p...
research
∙
09/07/2017