Complexity of Planar Embeddability of Trees inside Simple Polygons
Complexity of Prioritized Default Logics
Complexity of Problems for Commutative Grammars
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions
Complexity of Propositional Proofs under a Promise
Complexity of Resolution of Parametric Systems of Polynomial Equations and Inequations
Complexity of Scrambling: A New Twist to the Competence - Performance Distinction
Complexity of Self-Assembled Shapes
Complexity of Splits Reconstruction for Low-Degree Trees
Complexity of stochastic branch and bound methods for belief tree search in Bayesian reinforcement learning
Complexity of Strong Implementability
Complexity of Terminating Preference Elicitation
Complexity of the conditional colorability of graphs
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers
Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops
Complexity of the path avoiding forbidden pairs problem revisited
Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers
Complexity of tropical and min-plus linear prevarieties
Complexity of two-variable Dependence Logic and IF-Logic