Search Results for author:
Found 1 papers, 0 papers with code
A Complete Parameterized Complexity Analysis of Bounded Planning
The propositional planning problem is a notoriously difficult computational problem, which remains hard even under strong syntactical and structural restrictions.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
