Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract).
Claus-Peter SchnorrC. R. SubramanianPublished in: RANDOM (1998)
Keyphrases
- extended abstract
- learning algorithm
- worst case
- dynamic programming
- computational cost
- theoretical analysis
- efficient algorithms for computing
- space complexity
- exhaustive search
- orders of magnitude
- boolean functions
- optimization problems
- machine learning
- markov chain
- life cycle
- computational complexity
- data structure
- matrix multiplication
- optimal solution
- approximately optimal
- typical testors