4 citations · 8 across the 9 of their papers we have counts for
4 papers · 1 filter
Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing
Marek Černý, Tim Seppelt
Two graphs and are homomorphism indistinguishable over a graph class if they admit the same number of homomorphisms from every graph . Many…
Homomorphism Indistinguishability Relations induced by Quantum Groups
Tim Seppelt, Gian Luca Spitzer
Homomorphism indistinguishability is a way of characterising many natural equivalence relations on graphs. Two graphs and are called homomorphism indistinguishable over a g…
Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
Isolde Adler, Eva Fluck, Tim Seppelt +1
We study the expressive power of first-order logic with counting quantifiers, especially the -variable and quantifier-rank- fragment, using homomorphism indistinguishability.…
Symmetric Algebraic Circuits and Homomorphism Polynomials
Anuj Dawar, Benedikt Pago, Tim Seppelt
The central open question of algebraic complexity is whether VP is unequal to VNP, which is saying that the permanent cannot be represented by families of polynomial-size algebraic…