Amanote Research

Amanote Research

    RegisterSign In

The Complexity of Planning Problems With Simple Causal Graphs

Journal of Artificial Intelligence Research - United States
doi 10.1613/jair.2432
Full Text
Open PDF
Abstract

Available in full text

Categories
Artificial Intelligence
Date

February 26, 2008

Authors
O. GimenezA. Jonsson
Publisher

AI Access Foundation


Related search

The Complexity of Dissociation Set Problems in Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2011English

Complexity of Disjoint Paths Problems in Planar Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

The Complexity of Several Realizability Problems for Abstract Topological Graphs

English

On the Complexity of Shortest Path Problems on Discounted Cost Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Computational Complexity of Some Optimization Problems in Planning

English

On the Complexity of Reinforcement in Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2016English

Complexity and Approximability of Extended Spanning Star Forest Problems in General and Complete Graphs

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

Complexity Is Simple!

Journal of High Energy Physics
High Energy PhysicsNuclear
2018English

The Complexity of a Simple God

Axis Mundi
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy