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
详细信息
- 发表期刊/会议
- Electronic colloquium on computational complexity
- 发表日期
- 1997-01-01
- 发表年份
- 1997
关键词
Machine Learning and AlgorithmsAlgorithms and Data CompressionImbalanced Data Classification Techniques