Worst-case time complexities.
收藏NIAID Data Ecosystem2026-03-08 收录
下载链接：
https://figshare.com/articles/dataset/_Worst_case_time_complexities_/1485952
下载链接
链接失效反馈官方服务：
资源简介：
To save space, the O(.) symbols around each formula were omitted. Note that n = q(m − k+1). The time complexities for PgSA are given for the fixed-k mode with SA sparsity set to 1. In the variable-k mode or when SA sparsity larger than 1 is used, the number of visited SAPG locations should be added to the PgSA complexities.
创建时间：
2015-07-16
