The complexity of constraint satisfaction revisited

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

The purchase and pricing options for this item are unavailable. Select items are only available as part of a subscription package. You may try again later or contact us for more information.
1 Author(s)

This paper is a retrospective account of some of the developments leading up to, and ensuing from, the analysis of the complexity of some polynomial network consistency algorithms for constraint satisfaction problems