The Complexity of Plan Existence and Evaluation in Probabilistic Domains

02/06/2013
by   Judy Goldsmith, et al.
0

We examine the computational complexity of testing and finding small plans in probabilistic planning domains with succinct representations. We find that many problems of interest are complete for a variety of complexity classes: NP, co-NP, PP, NP^PP, co-NP^PP, and PSPACE. Of these, the probabilistic classes PP and NP^PP are likely to be of special interest in the field of uncertainty in artificial intelligence and are deserving of additional study. These results suggest a fruitful direction of future algorithmic development.

READ FULL TEXT
research
08/01/1998

The Computational Complexity of Probabilistic Planning

We examine the computational complexity of testing and finding small pla...
research
10/31/2011

The Complexity of Planning Problems With Simple Causal Graphs

We present three new complexity results for classes of planning problems...
research
09/21/2021

Computational Complexity of Quadratic Unconstrained Binary Optimization

In this paper, we study the computational complexity of the quadratic un...
research
01/15/2014

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

Recently, considerable focus has been given to the problem of determinin...
research
03/06/2023

The Linear Correlation of P and NP

P ?= NP or P vs NP is the core problem in computational complexity theor...
research
07/06/2021

Scheme-theoretic Approach to Computational Complexity II. The Separation of P and NP over ℂ, ℝ, and ℤ

We show that the problem of determining the feasibility of quadratic sys...
research
05/26/2021

BioNavi-NP: Biosynthesis Navigator for Natural Products

Nature, a synthetic master, creates more than 300,000 natural products (...

Please sign up or login with your details

Forgot password? Click here to reset