DOE OSTI · 1661834
Estimating the longest increasing subsequence in polylogarithmic time.
Abstract
Abstract not provided.
Keep this discovery
Explore connections, maps & timelines
Saks, Michael. 2011-07-01. Estimating the longest increasing subsequence in polylogarithmic time.. https://www.osti.gov/biblio/1661834
Cite the original work for its findings. Save a collection to share your selection of sources.