Search Results for author:
Found 9 papers, 0 papers with code
The Computational Complexity of Concise Hypersphere Classification
Hypersphere classification is a classical and foundational method that can provide easy-to-process explanations for the classification of real-valued and binary data.
The Complexity of Envy-Free Graph Cutting
The problem is NP-complete, and we analyze its complexity with respect to two natural complexity measures: the number of agents and the number of edges in the graph.
Computational Short Cuts in Infinite Domain Constraint Satisfaction
We show that this kind of infinite-domain backdoors have many of the positive computational properties that finite-domain backdoors have: the associated computational problems are fixed-parameter tractable whenever the underlying constraint language is finite.
Solving Infinite-Domain CSPs Using the Patchwork Property
Additionally, our approach is not restricted to binary constraints, so it is applicable to a strictly larger class of problems than that of Huang et al.
Clique-Width and Directed Width Measures for Answer-Set Programming
We then consider the graph parameter of signed clique-width and present a novel dynamic programming algorithm that is FPT w. r. t.
Backdoors into Heterogeneous Classes of SAT and CSP
In this paper we extend the classical notion of strong and weak backdoor sets for SAT and CSP by allowing that different instantiations of the backdoor variables result in instances that belong to different base classes; the union of the base classes forms a heterogeneous base class.
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation
We study the computational complexity of problems that arise in abstract argumentation in the context of dynamic argumentation, minimal change, and aggregation.
Parameterized Complexity Results for Exact Bayesian Network Structure Learning
Furthermore, we show that if the directed super-structure is acyclic, then exact Bayesian network structure learning can be carried out in quadratic time.
A Complete Parameterized Complexity Analysis of Bounded Planning
The propositional planning problem is a notoriously difficult computational problem, which remains hard even under strong syntactical and structural restrictions.
