Search for dissertations about: "Meysam Aghighi"
Found 1 swedish dissertation containing the words Meysam Aghighi.
-
1. Computational Complexity of some Optimization Problems in Planning
Abstract : Automated planning is known to be computationally hard in the general case. Propositional planning is PSPACE-complete and first-order planning is undecidable. One method for analyzing the computational complexity of planning is to study restricted subsets of planning instances, with the aim of differentiating instances with varying complexity. READ MORE
Result pages:
1