Curticapean, Radu

1. Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts
   2014/07/10 by Curticapean, Radu, Marx, Dániel · 2 citations
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
2. A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank
   2017/09/07 by Curticapean, Radu, Lindzey, Nathan, Nederlof, Jesper · 2 citations
   #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Representation Theory (math.RT)
3. Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths
   2021/07/01 by Curticapean, Radu, Dell, Holger, Husfeldt, Thore · 1 citation
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
4. Counting Small Induced Subgraphs: Hardness via Fourier Analysis
   2024/07/09 by Radu Curticapean, Curticapean, Radu, Daniel Neuen +1 · 2 citations
   Computer Science · #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning and Algorithms #Machine Learning and Data Classification
5. Count on CFI graphs for #P-hardness
   2023/05/08 by Curticapean, Radu · 1 citation
   #Combinatorics (math.CO) #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics