In the (binary) Distinct Vectors problem we are given a binary matrix A with pairwise different rows and want to select at most k columns such that, restricting the matrix to these columns, all rows are still pairwise different. A result by Froese et al. [JCSS] implies a 2^2^(O(k)) * poly(|A|)-time brute-force algorithm for Distinct Vectors. We show that this running time bound is essentially optimal by showing that there is a constant c such that the existence of an algorithm solving Distinct Vectors with running time 2^(O(2^(ck))) * poly(|A|) would contradict the Exponential Time Hypothesis.

Source : oai:arXiv.org:2002.01293

Volume: vol. 22 no. 4

Section: Discrete Algorithms

Published on: September 18, 2020

Submitted on: February 5, 2020

Keywords: Computer Science - Computational Complexity,Computer Science - Discrete Mathematics

This page has been seen 120 times.

This article's PDF has been downloaded 35 times.