A Lower Bound for the Bilinear Complexity of Some Semisimple Lie Algebras.
Hans F. de GrooteJoos HeintzPublished in: AAECC (1985)
Keyphrases
- lower bound
- worst case
- upper bound
- computational complexity
- objective function
- lower and upper bounds
- real time
- complexity analysis
- branch and bound algorithm
- decision problems
- branch and bound
- sufficiently accurate
- linear programming relaxation
- piecewise linear
- space complexity
- computational cost
- special case
- case study
- genetic algorithm
- data sets