A Double Exponential Lower Bound for the Distinct Vectors Problem.
Marcin PilipczukManuel SorgePublished in: CoRR (2020)
Keyphrases
- lower bound
- double exponential
- worst case
- upper bound
- branch and bound algorithm
- branch and bound
- data complexity
- np hard
- objective function
- vector space
- lower and upper bounds
- closely related
- feature vectors
- optimal solution
- transitive roles
- lower bounding
- principal components
- sample complexity
- expressive power
- average case
- polynomial approximation
- sufficiently accurate
- database