共 50 条
- [2] Parallel O(n2 7n/8) time-memory-processor tradeoff for knapsack-like problems NETWORK AND PARALLEL COMPUTING, PROCEEDINGS, 2005, 3779 : 197 - 204
- [3] A 2n/2-Time Algorithm for √n-SVP and √n-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP ADVANCES IN CRYPTOLOGY - EUROCRYPT 2021, PT I, 2021, 12696 : 467 - 497
- [8] Parallel time-memory-processor tradeoff O(25n/6) for knapsack-like NP-complete problems Ruan Jian Xue Bao/Journal of Software, 2007, 18 (06): : 1319 - 1327
- [10] Bis[μ-2-(1H-benzoimidazol-2-yl)benzoato-κ2N:O]bis{[2-(1H-benzoimidazol-2-yl)benzoato-κ2N,O]zinc(II)} ACTA CRYSTALLOGRAPHICA SECTION E-STRUCTURE REPORTS ONLINE, 2006, 62 : M3101 - M3103