From Evaluating Upper Bounds of the Complexity of Solving CSPs to Finding All the Solutions of CSPs

Gadi Solotorevsky. From Evaluating Upper Bounds of the Complexity of Solving CSPs to Finding All the Solutions of CSPs. In Eugene C. Freuder, editor, Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, Cambridge, Massachusetts, USA, August 19-22, 1996. Volume 1118 of Lecture Notes in Computer Science, pages 559-560, Springer, 1996.

Abstract

Abstract is missing.