Seppelt, Tim

1. An Algorithmic Meta Theorem for Homomorphism Indistinguishability
   2024/02/14 by Seppelt, Tim · 6 citations
   #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Logic in Computer Science (cs.LO)
2. Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth
   2023/08/11 by Fluck, Eva, Seppelt, Tim, Spitzer, Gian Luca · 4 citations
   #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)
3. NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability
   2024/07/15 by Kar, Prem Nigam, Roberson, David E., Seppelt, Tim +1 · 5 citations
   #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Optimization and Control (math.OC) #Quantum Physics (quant-ph)
4. The Complexity of Homomorphism Reconstructibility
   2023/10/13 by Böker, Jan, Härtel, Louis, Runde, Nina +2 · 2 citations
   #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
5. Symmetric Algebraic Circuits and Homomorphism Polynomials
   2025/02/10 by Anuj Dawar, Dawar, Anuj, Benedikt Pago +3 · 1 voice · 1 citation
   Computer Science · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #cs.CC
6. Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing
   2025/12/15 by Černý, Marek, Seppelt, Tim · 2 citations
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)