Home › Entities › academia › Change the World - How Hard Can that Be? On the Computational Complexity of Fixing Planning Models

Change the World - How Hard Can that Be? On the Computational Complexity of Fixing Planning Models

Research article (Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021) · cited 15× · AI/ML
academia openalex:W3187460178
Press Enter · cited answer in seconds

Change the World - How Hard Can that Be? On the Computational Complexity of Fixing Planning Models

Summary

Change the World - How Hard Can that Be? On the Computational Complexity of Fixing Planning Models is a scholarly article[1].

Key Facts

  • Change the World - How Hard Can that Be? On the Computational Complexity of Fixing Planning Models's instance of is recorded as scholarly article[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Change the World - How Hard Can that Be? On the Computational Complexity of Fixing Planning Models. Retrieved May 24, 2026, from https://4ort.xyz/entity/change-the-world-how-hard-can-that-be-on-the-computational-complexity-of-fixing-planning-models
MLA “Change the World - How Hard Can that Be? On the Computational Complexity of Fixing Planning Models.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/change-the-world-how-hard-can-that-be-on-the-computational-complexity-of-fixing-planning-models.
BibTeX @misc{4ortxyz_change-the-world-how-hard-can-that-be-on-the-computational-complexity-of-fixing-planning-models_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Change the World - How Hard Can that Be? On the Computational Complexity of Fixing Planning Models}}, year = {2026}, url = {https://4ort.xyz/entity/change-the-world-how-hard-can-that-be-on-the-computational-complexity-of-fixing-planning-models}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Change the World - How Hard Can that Be? On the Computational Complexity of Fixing Planning Models — https://4ort.xyz/entity/change-the-world-how-hard-can-that-be-on-the-computational-complexity-of-fixing-planning-models (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/change-the-world-how-hard-can-that-be-on-the-computational-complexity-of-fixing-planning-models · Last refreshed: