ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1401.3467
  4. Cited By
Planning over Chain Causal Graphs for Variables with Domains of Size 5
  Is NP-Hard

Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard

15 January 2014
Omer Giménez
Anders Jonsson
    LRM
ArXivPDFHTML

Papers citing "Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard"

3 / 3 papers shown
Title
The Complexity of Planning Problems With Simple Causal Graphs
The Complexity of Planning Problems With Simple Causal Graphs
Omer Giménez
Anders Jonsson
90
49
0
31 Oct 2011
The Fast Downward Planning System
The Fast Downward Planning System
M. Helmert
83
1,901
0
27 Sep 2011
Structure and Complexity in Planning with Unary Operators
Structure and Complexity in Planning with Unary Operators
Ronen I. Brafman
Carmel Domshlak
61
101
0
26 Jun 2011
1