Dörfler, Julian

1. Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness
   2019/04/23 by Dörfler, Julian, Roth, Marc, Schmitt, Johannes +1 · 2 citations
   #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
2. On geometric complexity theory: Multiplicity obstructions are stronger than occurrence obstructions
   2019/01/14 by Dörfler, Julian, Ikenmeyer, Christian, Panova, Greta · 1 citation
   #05E10 #68Q17 #Algebraic Geometry (math.AG) #Combinatorics (math.CO) #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Representation Theory (math.RT)
3. From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy
   2024/05/12 by Dörfler, Julian, van der Zander, Benito, Bläser, Markus +1 · 2 citations
   #Artificial Intelligence (cs.AI) #Computational Complexity (cs.CC) #FOS: Computer and information sciences
4. On the complexity of evaluating highest weight vectors
   2020/02/26 by Bläser, Markus, Dörfler, Julian, Ikenmeyer, Christian · 1 citation
   #14Q15 #68Q17 #68W30 #Combinatorics (math.CO) #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #I.1.2 #Representation Theory (math.RT)