Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete (Q3525565)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete |
scientific article; zbMATH DE number 5344654
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete |
scientific article; zbMATH DE number 5344654 |
Statements
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete (English)
0 references
17 September 2008
0 references
0.8686646819114685
0 references
0.8038585186004639
0 references
0.7809973955154419
0 references
0.7726459503173828
0 references
