Algorithms and conditional lower bounds for planning problems (Q2238604): Difference between revisions

@@ Property / OpenAlex ID @@
+W3138721759
@@ Property / OpenAlex ID: W3138721759 / rank @@
+Normal rank
@@ Property / cites work @@
+Planning Algorithms
@@ Property / cites work: Planning Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3266141
@@ Property / cites work: Q3266141 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4315289
@@ Property / cites work: Q4315289 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4382287
@@ Property / cites work: Q4382287 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Markov Decision Processes
@@ Property / cites work: The Complexity of Markov Decision Processes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4434179
@@ Property / cites work: Q4434179 / rank @@
+Normal rank
@@ Property / cites work @@
+AND/OR graph heuristic search methods
@@ Property / cites work: AND/OR graph heuristic search methods / rank @@
+Normal rank
@@ Property / cites work @@
+Planning and acting in partially observable stochastic domains
+Normal rank
@@ Property / cites work @@
+Q5713497
@@ Property / cites work: Q5713497 / rank @@
+Normal rank
@@ Property / cites work @@
+Weak, strong, and strong cyclic planning via symbolic model checking
+Normal rank
@@ Property / cites work @@
+On the menbership problem for functional and multivalued dependencies in relational databases
+Normal rank
@@ Property / cites work @@
+Number of quantifiers is better than number of tape cells
+Normal rank
@@ Property / cites work @@
+Q5875368
@@ Property / cites work: Q5875368 / rank @@
+Normal rank
@@ Property / cites work @@
+Plan aggregation for strong cyclic planning in nondeterministic domains
+Normal rank
@@ Property / cites work @@
+Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition
+Normal rank
@@ Property / cites work @@
+The computational complexity of propositional STRIPS planning
+Normal rank
@@ Property / cites work @@
+Refining complexity analyses in planning by exploiting the exponential time hypothesis
+Normal rank
@@ Property / cites work @@
+Time and Space Bounds for Planning
@@ Property / cites work: Time and Space Bounds for Planning / rank @@
+Normal rank
@@ Property / cites work @@
+Subcubic Equivalences Between Path, Matrix, and Triangle Problems
+Normal rank
@@ Property / cites work @@
+If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser
+Normal rank
@@ Property / cites work @@
+Q4607968
@@ Property / cites work: Q4607968 / rank @@
+Normal rank
@@ Property / cites work @@
+A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties
+Normal rank
@@ Property / cites work @@
+Multiplying matrices faster than coppersmith-winograd
+Normal rank
@@ Property / cites work @@
+Powers of tensors and fast matrix multiplication
@@ Property / cites work: Powers of tensors and fast matrix multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Graph expansion and communication costs of fast matrix multiplication
+Normal rank
@@ Property / cites work @@
+Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
+Normal rank
@@ Property / cites work @@
+A new algorithm for optimal 2-constraint satisfaction and its implications
+Normal rank
@@ Property / cites work @@
+ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Model and Objective Separation with Conditional Lower Bounds
+Normal rank