Login / Signup
Improved dynamic algorithms for longest increasing subsequence.
Tomasz Kociumaka
Saeed Seddighin
Published in:
STOC (2021)
Keyphrases
</>
data structure
computationally efficient
theoretical analysis
times faster
orders of magnitude
recently developed
machine learning
computational complexity
query processing
significant improvement
optimization problems
particle swarm optimization
machine learning algorithms