The complexity of binary matrix completion under diameter constraints

We thoroughly study a novel but basic combinatorial matrix completion problem: Given a binary incomplete matrix, fill in the missing entries so that every pair of rows in the resulting matrix has a Hamming distance within a specified range. We obtain an almost complete picture of the complexity land...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computer and system sciences Vol. 132; pp. 45 - 67
Main Authors:	Koana, Tomohiro, Froese, Vincent, Niedermeier, Rolf
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.03.2023
Subjects:	2-SAT Combinatorial algorithms Complexity dichotomy Consensus problems Graph factors Hamming distance NP-hard problems Stringology Sunflowers Stringology Complexity dichotomy Combinatorial algorithms Hamming distance NP-hard problems Consensus problems Graph factors 2-SAT Sunflowers
ISSN:	0022-0000, 1090-2724
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!