Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254)
From MaRDI portal
(Redirected from Item:Q5919327)
 | 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: Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect |
scientific article; zbMATH DE number 7152263
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
4 October 2018
0 references
16 January 2020
0 references
Boolean satisfiability
0 references
subset sum
0 references
combinatorial reconfiguration
0 references
PSPACE-completeness
0 references
computational complexity
0 references
reconfiguration
0 references
subset sum problem
0 references
0 references
1.0000002
0 references
0.86754775
0 references
0.86754775
0 references
0.8276992
0 references
0.82187027
0 references
0.8207876
0 references
0.81901306
0 references
0.81901306
0 references
