Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete (Q3525565)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete |
scientific article |
Statements
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete (English)
0 references
17 September 2008
0 references
