Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps.
Peter BürgisserMartin LotzPublished in: FOCS (2002)
Keyphrases
- lower bound
- worst case
- upper bound
- objective function
- average case complexity
- computational complexity
- complexity measures
- learning algorithm
- branch and bound algorithm
- np hard
- branch and bound
- maximum likelihood
- linear programming relaxation
- complexity analysis
- decision problems
- neural network
- theoretical analysis
- singular value decomposition
- real time
- special case
- knapsack problem
- vc dimension
- optimal solution
- information systems
- lower bounding
- machine learning
- randomly generated problems