Lower bounds on the bounded coefficient complexity of bilinear maps.
Peter BürgisserMartin LotzPublished in: J. ACM (2004)
Keyphrases
- lower bound
- worst case
- upper bound
- average case complexity
- objective function
- complexity measures
- branch and bound algorithm
- case study
- lower and upper bounds
- space complexity
- optimal solution
- branch and bound
- computational cost
- computational complexity
- complexity analysis
- theoretical analysis
- learning theory
- query processing
- average case
- neural network