Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-complete

Abstract

A theorem from the title is proved using a novelty combinatorial approach - fibre construction. New proof method in the area.

Keywords

• Combinatorial
• Proof
• Subprojective
• Constraint
• Satisfaction
• Problems
• NP-complete