The Complexity of Modified Instances
| dc.creator | Liberatore, Paolo | |
| dc.date | 2004-02-23 | |
| dc.date.accessioned | 2026-07-07T03:20:57Z | |
| dc.date.available | 2026-07-07T03:20:57Z | |
| dc.description | In this paper we study the complexity of solving a problem when a solution of a similar instance is known. This problem is relevant whenever instances may change from time to time, and known solutions may not remain valid after the change. We consider two scenarios: in the first one, what is known is only a solution of the problem before the change; in the second case, we assume that some additional information, found during the search for this solution, is also known. In the first setting, the techniques from the theory of NP-completeness suffice to show complexity results. In the second case, negative results can only be proved using the techniques of compilability, and are often related to the size of considered changes. | |
| dc.identifier | https://arxiv.org/abs/cs/0402053 | |
| dc.identifier | http://arxiv.org/abs/cs/0402053 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32015 | |
| dc.subject | Computational Complexity | |
| dc.subject | Artificial Intelligence | |
| dc.subject | F.1.3; I.2.8 | |
| dc.title | The Complexity of Modified Instances | |
| dc.type | text |