Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q6830218)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7152263
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect |
scientific article; zbMATH DE number 7152263 |
Statements
Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (English)
0 references
16 January 2020
0 references
computational complexity
0 references
reconfiguration
0 references
Boolean satisfiability
0 references
subset sum problem
0 references
