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 条
  • [31] Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem
    Kolpakov, R. M.
    Posypkin, M. A.
    DISCRETE MATHEMATICS AND APPLICATIONS, 2010, 20 (01): : 95 - 112
  • [32] An alternative to Ben-Or's lower bound for the knapsack problem complexity
    Brimkov, VE
    Dantchev, SS
    APPLIED MATHEMATICS LETTERS, 2002, 15 (02) : 187 - 191
  • [33] A LOWER BOUND ON THE COMPLEXITY OF THE CONVEX-HULL PROBLEM FOR SIMPLE POLYHEDRA
    KLAPPER, A
    INFORMATION PROCESSING LETTERS, 1987, 25 (03) : 159 - 161
  • [34] Parameterized dominating set problem in chordal graphs: complexity and lower bound
    Chunmei Liu
    Yinglei Song
    Journal of Combinatorial Optimization, 2009, 18 : 87 - 97
  • [35] A note on the shortest lattice vector problem
    Kumar, R
    Sivakumar, D
    FOURTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1999, : 200 - 204
  • [36] A geometric lower bound on the extension complexity of polytopes based on the f-vector
    Dewez, Julien
    Gillis, Nicolas
    Glineur, Francois
    DISCRETE APPLIED MATHEMATICS, 2021, 303 : 22 - 38
  • [37] An Efficient Algorithm for the Shortest Vector Problem
    Chuang, Yu-Lun
    Fan, Chun-, I
    Tseng, Yi-Fan
    IEEE ACCESS, 2018, 6 : 61478 - 61487
  • [38] Techniques for Solving Shortest Vector Problem
    Reddy, V. Dinesh
    Ravi, P.
    Abdul, Ashu
    Morampudi, Mahesh Kumar
    Bojjagani, Sriramulu
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2021, 12 (05) : 841 - 848
  • [39] An improved lower bound for a bi-criteria scheduling problem
    Yan, Jin
    OPERATIONS RESEARCH LETTERS, 2008, 36 (01) : 57 - 60
  • [40] An improved lower bound for multicolor Ramsey numbers and a problem of Erdos
    Sawin, Will
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2022, 188
12345