If the Current Clique Algorithms are Optimal, So is Valiant's Parser.

Amir Abboud Arturs Backurs Virginia Vassilevska Williams

Published in: FOCS (2015)

Keyphrases

worst case
computationally efficient
times faster
learning algorithm
data structure
theoretical analysis
computational complexity
significant improvement
computational cost
exhaustive search
data mining
decision trees
optimization problems
orders of magnitude
learning theory