Lower Bounds for Special Cases of Syntactic Multilinear ABPs.
C. RamyaB. V. Raghavendra RaoPublished in: COCOON (2018)
Keyphrases
- lower bound
- special case
- np hard
- upper bound
- branch and bound algorithm
- branch and bound
- natural language
- worst case
- higher order
- objective function
- semantic representation
- high order
- quadratic assignment problem
- lower bounding
- optimal solution
- lower and upper bounds
- vc dimension
- approximation algorithms
- semantic role labeling
- computational complexity
- sample complexity
- natural language text
- np complete
- parse tree
- dimensionality reduction
- integer programming
- upper and lower bounds
- syntactic structures
- optimal cost
- set of randomly generated instances