The Shortest Vector Problem in L 2 is NP-hard for Randomized Reductions. 论文
1997Electronic colloquium on computational complexity引用 248
Machine Learning and AlgorithmsAlgorithms and Data CompressionImbalanced Data Classification Techniques
The Shortest Vector Problem in L 2 is NP-hard for Randomized Reductions. · 相关文章
暂无数据