Tractability of Drawing Interpretation
In this section we introduce the basic theoretical tools that have been developed for the analysis of the tractability of constraint satisfaction and valued constraint satisfaction problems. In the next section we apply some of these results to problems related to the interpretation of line drawings. A problem is considered to be tractable if there is a polynomial-time algorithm to solve it, and intractable if not. Assuming NP≠P, any problem that is NP-hard is intractable.
Unable to display preview. Download preview PDF.