Generating tractable CSPs by means of adjoint functors Jan Foniok joint work with Claude Tardif Fête of Combinatorics and Computer Science - Constraint satisfaction problem - Document - PDFSEARCH.IO

First Page	Meta Content
	Generating tractable CSPs by means of adjoint functors Jan Foniok joint work with Claude Tardif Fête of Combinatorics and Computer Science Add to Reading List Document Date: 2008-11-18 08:48:31 Open Document File Size: 693,20 KB Share Result on Facebook

Generating tractable CSPs by means of adjoint functors Jan Foniok joint work with Claude Tardif Fête of Combinatorics and Computer ScienceAdd to Reading List