[Untitled]

Authors: Peter G. Jeavonscomputing Laboratory

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://www.cs.sfu.ca/~abulatov/papers/stoc01.ps.

Subject Terms: Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems--computations on discrete structures, I.2.4 [Artificial Intelligence, Knowledge Representation Formalisms and Methods--relation systems, G.2.1 [Discrete Mathematics, Combinatorics--combinatorial algorithms General Terms Algorithms, Theory Keywords constraint satisfaction problem, constraint language, complexity, tractability, NP-completeness, algebraic invariance property, relational clone

File Description: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.1875; http://www.cs.sfu.ca/~abulatov/papers/stoc01.ps

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.1875
http://www.cs.sfu.ca/~abulatov/papers/stoc01.ps