The Complexity of Modified Instances

Details The Complexity of Modified Instances The Complexity of Modified Instances

2004-02-23

arxiv.org/abs/cs/0402053v1

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Complexity of Modified Instances does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Complexity of Modified Instances, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Complexity of Modified Instances will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-349479