A complete parameterized complexity analysis of bounded planning (Q2353405): Difference between revisions

@@ Property / author @@
+Christer Bäckström
@@ Property / author: Christer Bäckström / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2071900144
@@ Property / OpenAlex ID: W2071900144 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.7828
@@ Property / arXiv ID: 1310.7828 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving MAX-\(r\)-SAT above a tight lower bound
@@ Property / cites work: Solving MAX-\(r\)-SAT above a tight lower bound / rank @@
+Normal rank
@@ Property / cites work @@
+Q3457202
@@ Property / cites work: Q3457202 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3457201
@@ Property / cites work: Q3457201 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Limits for Compact Plan Representations
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity and Kernel Bounds for Hard Planning Problems
+Normal rank
@@ Property / cites work @@
+Kernelization: New Upper and Lower Bound Techniques
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization Lower Bounds by Cross-Composition
@@ Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411159
@@ Property / cites work: Q4411159 / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of propositional STRIPS planning
+Normal rank
@@ Property / cites work @@
+A probabilistic analysis of propositional STRIPS planning
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes
+Normal rank
@@ Property / cites work @@
+The Turing way to parameterized complexity
@@ Property / cites work: The Turing way to parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Causal graphs and structurally restricted planning
+Normal rank
@@ Property / cites work @@
+Q4263467
@@ Property / cites work: Q4263467 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4449303
@@ Property / cites work: Q4449303 / rank @@
+Normal rank
@@ Property / cites work @@
+The Lost Continent of Polynomial Time: Preprocessing and Kernelization
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q5313998
@@ Property / cites work: Q5313998 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3624119
@@ Property / cites work: Q3624119 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of blocks-world planning
@@ Property / cites work: On the complexity of blocks-world planning / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity results for standard benchmark domains in planning
+Normal rank
@@ Property / cites work @@
+Q3624014
@@ Property / cites work: Q3624014 / rank @@
+Normal rank
@@ Property / cites work @@
+Strong bounds on the approximability of two Pspace-hard problems in propositional planning
+Normal rank
@@ Property / cites work @@
+State-variable planning under structural restrictions: algorithms and complexity
+Normal rank
@@ Property / cites work @@
+Tractable plan existence does not imply tractable plan generation
+Normal rank
@@ Property / cites work @@
+FPT algorithms for connected feedback vertex set
@@ Property / cites work: FPT algorithms for connected feedback vertex set / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
+Normal rank
@@ Property / cites work @@
+The Causal Graph Revisited for Directed Model Checking
+Normal rank