首页
学术期刊
论文检测
AIGC检测
热点
更多
数据
Improved lower bound for the complexity of unique shortest vector problem
被引:0
|
作者
:
Baolong Jin
论文数:
0
引用数:
0
h-index:
0
机构:
Chinese Academy of Sciences,State Key Laboratory of Information Security, Institute of Information Engineering
Baolong Jin
Rui Xue
论文数:
0
引用数:
0
h-index:
0
机构:
Chinese Academy of Sciences,State Key Laboratory of Information Security, Institute of Information Engineering
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 条
[41]
An improved lower bound on approximation algorithms for the Closest Substring problem
Wang, Jianxin
论文数:
0
引用数:
0
h-index:
0
机构:
Cent S Univ, Sch Informat Sci & Engn, Changsha 410093, Peoples R China
Cent S Univ, Sch Informat Sci & Engn, Changsha 410093, Peoples R China
Wang, Jianxin
Chen, Jianer
论文数:
0
引用数:
0
h-index:
0
机构:
Cent S Univ, Sch Informat Sci & Engn, Changsha 410093, Peoples R China
Texas A&M Univ, Dept Comp Sci, College Stn, TX 77843 USA
Cent S Univ, Sch Informat Sci & Engn, Changsha 410093, Peoples R China
Chen, Jianer
Huang, Min
论文数:
0
引用数:
0
h-index:
0
机构:
Cent S Univ, Sch Informat Sci & Engn, Changsha 410093, Peoples R China
Cent S Univ, Sch Informat Sci & Engn, Changsha 410093, Peoples R China
Huang, Min
INFORMATION PROCESSING LETTERS,
2008,
107
(01)
: 24
-
28
[42]
AN IMPROVED ASSIGNMENT LOWER BOUND FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM
STEWART, WR
论文数:
0
引用数:
0
h-index:
0
STEWART, WR
OPERATIONS RESEARCH LETTERS,
1985,
4
(02)
: 55
-
60
[43]
A LOWER BOUND ON DETERMINANTAL COMPLEXITY
Kumar, Mrinal
论文数:
0
引用数:
0
h-index:
0
机构:
Indian Inst Technol, Dept Comp Sci, Mumbai, Maharashtra, India
Indian Inst Technol, Dept Comp Sci, Mumbai, Maharashtra, India
Kumar, Mrinal
Volk, Ben Lee
论文数:
0
引用数:
0
h-index:
0
机构:
Reichman Univ, Efi Arazi Sch Comp Sci, IDC Herzliya, Herzliyya, Israel
Indian Inst Technol, Dept Comp Sci, Mumbai, Maharashtra, India
Volk, Ben Lee
COMPUTATIONAL COMPLEXITY,
2022,
31
(02)
[44]
IMPROVED COMPLEXITY BOUND FOR THE MAXIMUM CARDINALITY BOTTLENECK BIPARTITE MATCHING PROBLEM
PUNNEN, AP
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV NEW BRUNSWICK,FAC ADM,FREDERICTON E3B 5A3,NB,CANADA
PUNNEN, AP
NAIR, KPK
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV NEW BRUNSWICK,FAC ADM,FREDERICTON E3B 5A3,NB,CANADA
NAIR, KPK
DISCRETE APPLIED MATHEMATICS,
1994,
55
(01)
: 91
-
93
[45]
A Lower Bound on Determinantal Complexity
Mrinal Kumar
论文数:
0
引用数:
0
h-index:
0
机构:
IIT Bombay,Department of Computer Science IIT Bombay
Mrinal Kumar
Ben Lee Volk
论文数:
0
引用数:
0
h-index:
0
机构:
IIT Bombay,Department of Computer Science IIT Bombay
Ben Lee Volk
computational complexity,
2022,
31
[46]
Problem characterization of unique shortest path routing
Zhang, Changyong
论文数:
0
引用数:
0
h-index:
0
机构:
Curtin Univ, Fac Business, Miri, Malaysia
Curtin Univ, Fac Business, Miri, Malaysia
Zhang, Changyong
COMPUTERS & INDUSTRIAL ENGINEERING,
2023,
178
[47]
On the complexity of the shortest-path broadcast problem
Crescenzi, Pierluigi
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Florence, I-50121 Florence, Italy
Univ Florence, I-50121 Florence, Italy
Crescenzi, Pierluigi
论文数:
引用数:
h-index:
机构:
Fraigniaud, Pierre
Halldorsson, Magnus
论文数:
0
引用数:
0
h-index:
0
机构:
Reykjavik Univ, Reykjavik, Iceland
Univ Florence, I-50121 Florence, Italy
Halldorsson, Magnus
Harutyunyan, Hovhannes A.
论文数:
0
引用数:
0
h-index:
0
机构:
Concordia Univ, Montreal, PQ, Canada
Univ Florence, I-50121 Florence, Italy
Harutyunyan, Hovhannes A.
Pierucci, Chiara
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Florence, I-50121 Florence, Italy
Univ Florence, I-50121 Florence, Italy
Pierucci, Chiara
Pietracaprina, Andrea
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Padua, I-35100 Padua, Italy
Univ Florence, I-50121 Florence, Italy
Pietracaprina, Andrea
Pucci, Geppino
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Padua, I-35100 Padua, Italy
Univ Florence, I-50121 Florence, Italy
Pucci, Geppino
DISCRETE APPLIED MATHEMATICS,
2016,
199
: 101
-
109
[48]
Upper Bound for the Coefficients of the Shortest Vector of Random Lattice
Kaminaga, Masahiro
论文数:
0
引用数:
0
h-index:
0
机构:
Tohoku Gakuin Univ, Dept Informat Technol Engn, Sendai Shi 9858537, Japan
Tohoku Gakuin Univ, Dept Informat Technol Engn, Sendai Shi 9858537, Japan
Kaminaga, Masahiro
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES,
2023,
E106A
(12)
: 1585
-
1588
[49]
Upper Bound of The Shortest Vector Coefficients and Its Applications
Naganuma, Ken
论文数:
0
引用数:
0
h-index:
0
机构:
Hitachi Ltd, Yokohama Res Lab, Yokohama, Kanagawa, Japan
Hitachi Ltd, Yokohama Res Lab, Yokohama, Kanagawa, Japan
Naganuma, Ken
Yoshino, Masayuki
论文数:
0
引用数:
0
h-index:
0
机构:
Hitachi Ltd, Yokohama Res Lab, Yokohama, Kanagawa, Japan
Hitachi Ltd, Yokohama Res Lab, Yokohama, Kanagawa, Japan
Yoshino, Masayuki
Sato, Hisayoshi
论文数:
0
引用数:
0
h-index:
0
机构:
Hitachi Ltd, Yokohama Res Lab, Yokohama, Kanagawa, Japan
Hitachi Ltd, Yokohama Res Lab, Yokohama, Kanagawa, Japan
Sato, Hisayoshi
2012 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2012),
2012,
: 426
-
430
[50]
A COMPLEMENT TO TARJAN RESULT ABOUT THE LOWER BOUND ON THE COMPLEXITY OF THE SET UNION PROBLEM
BANACHOWSKI, L
论文数:
0
引用数:
0
h-index:
0
BANACHOWSKI, L
INFORMATION PROCESSING LETTERS,
1980,
11
(02)
: 59
-
65
←
1
2
3
4
5
→