The complexity of binary matrix completion under diameter constraints (Q2678254)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of binary matrix completion under diameter constraints |
scientific article |
Statements
The complexity of binary matrix completion under diameter constraints (English)
0 references
9 January 2023
0 references
sunflowers
0 references
Hamming distance
0 references
stringology
0 references
consensus problems
0 references
NP-hard problems
0 references
complexity dichotomy
0 references
combinatorial algorithms
0 references
graph factors
0 references
2-SAT
0 references
0 references
0 references
