Universal Factor Graphs for Every NP-Hard Boolean CSP. (Q2969623)
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: Universal Factor Graphs for Every NP-Hard Boolean CSP. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Universal Factor Graphs for Every NP-Hard Boolean CSP. |
scientific article |
Statements
22 March 2017
0 references
hardness of approximation
0 references
hardness with preprocessing
0 references
Universal Factor Graphs for Every NP-Hard Boolean CSP. (English)
0 references
