Lower bounds for special cases of syntactic multilinear ABPs.
C. RamyaB. V. Raghavendra RaoPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- lower bound
- special case
- np hard
- upper bound
- higher order
- branch and bound algorithm
- lower and upper bounds
- high order
- natural language
- branch and bound
- lower bounding
- upper and lower bounds
- computational complexity
- approximation algorithms
- objective function
- vc dimension
- principal component analysis
- optimal solution
- dimensionality reduction
- worst case
- optimal cost
- syntactic semantic
- sample complexity
- scheduling problem
- semantic representation
- max sat
- quadratic assignment problem
- feature extraction
- syntactic categories
- higher order singular value decomposition