Markus Kröll

1. A complexity theory for hard enumeration problems
   2019/03/06 by Nadia Creignou, Markus Kröll, Reinhard Pichler +2 · 5 citations
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Constraint Satisfaction and Optimization
2. A Complexity Theory for Hard Enumeration Problems
   2016/10/18 by Nadia Creignou, Markus Kröll, Creignou, Nadia +7 · 3 citations
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #F.1.3 #FOS: Computer and information sciences #Machine Learning and Algorithms #cs.CC
3. Enumeration Complexity of Conjunctive Queries with Functional\n Dependencies
   2017/12/21 by Nofar Carmeli, Markus Kröll, Carmeli, Nofar +1 · 2 citations
   Computer Science · #Advanced Database Systems and Queries #Computational Complexity (cs.CC) #Data Management and Algorithms #Databases (cs.DB) #FOS: Computer and information sciences #H.2.3 #Logic, Reasoning, and Knowledge
4. Efficiently Enumerating Minimal Triangulations
   2016/04/11 by Nofar Carmeli, Batya Kenig, Carmeli, Nofar +5 · 1 citation
   Computer Science · #Advanced Graph Neural Networks #Bayesian Modeling and Causal Inference #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning and Data Classification
5. Complexity Bounds for Relational Algebra over Document Spanners
   2019/01/14 by Liat Peterfreund, Dominik D. Freydenberger, Peterfreund, Liat +5 · 1 citation
   Computer Science · #Databases (cs.DB) #FOS: Computer and information sciences #cs.DB