Lower Bounds for Special Cases of Syntactic Multilinear ABPs.
C. RamyaB. V. Raghavendra RaoPublished in: CoRR (2018)
Keyphrases
- lower bound
- special case
- np hard
- upper bound
- branch and bound algorithm
- branch and bound
- worst case
- objective function
- natural language
- upper and lower bounds
- higher order
- lower and upper bounds
- linear programming relaxation
- tensor decomposition
- max sat
- semantic representation
- syntactic semantic
- approximation algorithms
- high order
- principal component analysis
- computational complexity
- optimal solution
- quadratic assignment problem
- lower bounding
- randomly generated problems
- min sum
- np complete
- linear programming
- search space
- optimal cost