„Complex problems“
Suchergebnisse
2.217 Treffer
-
Quantifiers Closed Under Partial Polymorphisms
-
On the Complexity of Algorithms with Predictions for Dynamic Graph Problems
-
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials III: Actions by Classical Groups
-
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees
-
Drawn Tree Decomposition: New Approach for Graph Drawing Problems
-
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
-
Parameterized Complexity Classification for Interval Constraints
-
Existential Second-Order Logic over Graphs: Parameterized Complexity
-
Kernelizing Temporal Exploration Problems
-
Randomized and Quantum Query Complexities of Finding a King in a Tournament
-
On the Node-Averaged Complexity of Locally Checkable Problems on Trees
-
Universal Quantification Makes Automatic Structures Hard to Decide
-
Structural Parameterizations for Two Bounded Degree Problems Revisited
-
Tight Algorithms for Connectivity Problems Parameterized by Clique-Width
-
Parameterized Complexity of Domination Problems Using Restricted Modular Partitions
-
Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs
-
Tight Algorithmic Applications of Clique-Width Generalizations
-
Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes
-
Approximate Degree Lower Bounds for Oracle Identification Problems
-
Constant-Depth Circuits vs. Monotone Circuits