Roth, Marc
- Humanity's Last Exam
2025/01/24 by Long Phan, Alice Gatti, Phan, Long +2240 · 9 voices · 108 citations
#cs.LG #cs.AI #cs.CL
- Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies
2021/03/09 by Marco Bressan, Marc Roth, Bressan, Marco +1 · 3 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Limits and Structures in Graph Theory #Markov Chains and Monte Carlo Methods
- Counting Subgraphs in Somewhere Dense Graphs
2022/09/07 by Bressan, Marco, Goldberg, Leslie Ann, Meeks, Kitty +1 · 2 citations
#Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
- The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree
2022/11/03 by Bressan, Marco, Lanzinger, Matthias, Roth, Marc · 2 citations
#Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
- Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness
2018/07/05 by Roth, Marc, Schmitt, Johannes · 1 citation
#Computational Complexity (cs.CC) #FOS: Computer and information sciences
- Counting Answers to Existential Questions
2019/02/13 by Dell, Holger, Roth, Marc, Wellnitz, Philip · 1 citation
#Computational Complexity (cs.CC) #FOS: Computer and information sciences
- Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness
2019/04/23 by Dörfler, Julian, Roth, Marc, Schmitt, Johannes +1 · 1 citation
#Combinatorics (math.CO) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
- Counting Small Induced Subgraphs Satisfying Monotone Properties
2020/04/14 by Marc Roth, Roth, Marc, Johannes Schmitt +3 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Markov Chains and Monte Carlo Methods
- Counting Small Induced Subgraphs with Hereditary Properties
2021/11/03 by Focke, Jacob, Roth, Marc · 1 citation
#Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.2.1
- The Weisfeiler-Leman Dimension of Conjunctive Queries
2023/10/29 by Andreas Göbel, Leslie Ann Goldberg, Göbel, Andreas +3 · 1 citation
Computer Science · #Quantum Computing Algorithms and Architecture #Advanced Graph Neural Networks #Stochastic Gradient Optimization Techniques
- The Parametrised Complexity of Counting Small Sub-Hypergraphs
2025/06/17 by M. Bressan, Julian Brinkmann, Bressan, Marco +7 · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Limits and Structures in Graph Theory