Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete.

Jaroslav Nesetril, Mark H. Siggers

Browse the full MFCS paper archive.