Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
IJCAI
/
Paper
Change the World - How Hard Can that Be? On the Computational Complexity of Fixing Planning Models.
Songtuan Lin
,
Pascal Bercher
Venue
A*
IJCAI
Year
2021
Proceedings
IJCAI
DBLP record
conf/ijcai/LinB21 ↗
Browse the full
IJCAI paper archive
.