58 citations · 327 across the 60 of their papers we have counts for
Showing 2014 · cs.AIShow all
2 papers · 2 filters
cs.AI2014
Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning
Serge Gaspers, Stefan Szeider
We present a first theoretical analysis of the power of polynomial-time preprocessing for important combinatorial problems from various areas in AI. We consider problems from Const…
cs.AI2014★ 58 cited
Parameterized Complexity Results for Exact Bayesian Network Structure Learning
Sebastian Ordyniak, Stefan Szeider
Bayesian network structure learning is the notoriously difficult problem of discovering a Bayesian network that optimally represents a given set of training data. In this paper we…