Improved lower bound for the complexity of unique shortest vector problem

被引：0
|
作者：
Baolong Jin
Rui Xue
机构：
[1] Chinese Academy of Sciences,State Key Laboratory of Information Security, Institute of Information Engineering
[2] University of Chinese Academy of Sciences,School of Cyber Security
来源：
Cybersecurity | / 6卷
关键词：
Computational complexity; Unique shortest vector problem; Bounded distance decoding; Complexity reduction;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] Improved lower bound for the complexity of unique shortest vector problem
    Jin, Baolong
    Xue, Rui
    CYBERSECURITY, 2023, 6 (01)
  • [2] Improved hardness results for unique shortest vector problem
    Aggarwal, Divesh
    Dubey, Chandan
    INFORMATION PROCESSING LETTERS, 2016, 116 (10) : 631 - 637
  • [3] On the unique shortest lattice vector problem
    Kumar, SR
    Sivakumar, D
    THEORETICAL COMPUTER SCIENCE, 2001, 255 (1-2) : 641 - 648
  • [4] A lower bound for the shortest path problem
    Mulmuley, K
    Shah, P
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 63 (02) : 253 - 267
  • [5] A lower bound for the Shortest Path problem
    Mulmuley, K
    Shah, P
    15TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 14 - 21
  • [6] Complexity Considerations, cSAT problem lower bound
    Hofman, Radoslaw
    IMECS 2007: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2007, : 451 - 458
  • [7] An improved lower bound for the time complexity of mutual exclusion
    Anderson, JH
    Kim, YJ
    DISTRIBUTED COMPUTING, 2002, 15 (04) : 221 - 253
  • [8] An improved lower bound on the sensitivity complexity of graph properties
    Sun, Xiaoming
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (29) : 3524 - 3529
  • [9] An improved lower bound for the time complexity of mutual exclusion
    James H. Anderson
    Yong-Jik Kim
    Distributed Computing, 2002, 15 : 221 - 253
  • [10] An Improved Lower Bound for the Multimedian Location Problem
    Ranganath Nuggehalli
    Timothy J. Lowe
    James E. Ward
    Annals of Operations Research, 2002, 110 : 17 - 31
12345