Skip to Main Content
To access full text, please use your member or institutional sign in.
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
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.© Copyright 2018 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.