Lower Bounds for Syntactically Multilinear Algebraic Branching Programs.
Maurice J. JansenPublished in: MFCS (2008)
Keyphrases
- lower bound
- upper bound
- higher order
- branch and bound algorithm
- high order
- np hard
- branch and bound
- optimal solution
- lower and upper bounds
- upper and lower bounds
- lower bounding
- vc dimension
- worst case
- objective function
- optimal cost
- randomly generated problems
- dimensionality reduction
- sample complexity
- concept class
- online algorithms
- quadratic assignment problem