首页
学术期刊
论文检测
AIGC检测
热点
更多
数据
Generic complexity of NP-complete problems
被引:0
|
作者
:
机构
:
来源
:
GROUP-BASED CRYPTOGRAPHY
|
2008年
关键词
:
D O I
:
暂无
中图分类号
:
TP301 [理论、方法];
学科分类号
:
081202 ;
摘要
:
引用
收藏
页码:129 / 134
页数:6
相关论文
共 50 条
[1]
NP-COMPLETE SCHEDULING PROBLEMS
ULLMAN, JD
论文数:
0
引用数:
0
h-index:
0
机构:
PRINCETON UNIV,DEPT ELECT ENGN,PRINCETON,NJ 08540
ULLMAN, JD
JOURNAL OF COMPUTER AND SYSTEM SCIENCES,
1975,
10
(03)
: 384
-
393
[2]
Entropy for NP-complete problems
Levchenkov, V.S.
论文数:
0
引用数:
0
h-index:
0
Levchenkov, V.S.
Doklady Akademii Nauk,
2001,
376
(02)
: 175
-
178
[3]
The entropy of NP-complete problems
Levchenkov, VS
论文数:
0
引用数:
0
h-index:
0
机构:
Moscow MV Lomonosov State Univ, Moscow 119899, Russia
Moscow MV Lomonosov State Univ, Moscow 119899, Russia
Levchenkov, VS
DOKLADY MATHEMATICS,
2001,
63
(01)
: 130
-
132
[4]
Decidability of NP-Complete Problems
A. A. Vagis
论文数:
0
引用数:
0
h-index:
0
机构:
National Academy of Sciences of Ukraine,V. M. Glushkov Institute of Cybernetics
A. A. Vagis
A. M. Gupal
论文数:
0
引用数:
0
h-index:
0
机构:
National Academy of Sciences of Ukraine,V. M. Glushkov Institute of Cybernetics
A. M. Gupal
Cybernetics and Systems Analysis,
2022,
58
: 914
-
916
[5]
Decidability of NP-Complete Problems
Vagis, A. A.
论文数:
0
引用数:
0
h-index:
0
机构:
Natl Acad Sci Ukraine, VM Glushkov Inst Cybernet, Kiev, Ukraine
Natl Acad Sci Ukraine, VM Glushkov Inst Cybernet, Kiev, Ukraine
Vagis, A. A.
Gupal, A. M.
论文数:
0
引用数:
0
h-index:
0
机构:
Natl Acad Sci Ukraine, VM Glushkov Inst Cybernet, Kiev, Ukraine
Natl Acad Sci Ukraine, VM Glushkov Inst Cybernet, Kiev, Ukraine
Gupal, A. M.
CYBERNETICS AND SYSTEMS ANALYSIS,
2022,
58
(06)
: 914
-
916
[6]
AVERAGE POLYNOMIAL-TIME COMPLEXITY OF SOME NP-COMPLETE PROBLEMS
DIEU, PD
论文数:
0
引用数:
0
h-index:
0
机构:
INST MATH,HANOI,VIETNAM
INST MATH,HANOI,VIETNAM
DIEU, PD
THANH, LC
论文数:
0
引用数:
0
h-index:
0
机构:
INST MATH,HANOI,VIETNAM
INST MATH,HANOI,VIETNAM
THANH, LC
HOA, LT
论文数:
0
引用数:
0
h-index:
0
机构:
INST MATH,HANOI,VIETNAM
INST MATH,HANOI,VIETNAM
HOA, LT
THEORETICAL COMPUTER SCIENCE,
1986,
46
(2-3)
: 219
-
327
[7]
Universal solutions for NP-complete problems
Portier, N
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Lyon 1, CNRS, Inst Girard Desargues, UPRESA 5028, F-69622 Villeurbanne, France
Univ Lyon 1, CNRS, Inst Girard Desargues, UPRESA 5028, F-69622 Villeurbanne, France
Portier, N
THEORETICAL COMPUTER SCIENCE,
1998,
201
(1-2)
: 137
-
150
[8]
New NP-complete partition problems
Saeednia, S
论文数:
0
引用数:
0
h-index:
0
机构:
Free Univ Brussels, Dept Informat, B-1050 Brussels, Belgium
Free Univ Brussels, Dept Informat, B-1050 Brussels, Belgium
Saeednia, S
IEEE TRANSACTIONS ON INFORMATION THEORY,
2002,
48
(07)
: 2092
-
2094
[9]
FLOW INTERPRETATION OF NP-COMPLETE PROBLEMS
DAVYDOV, GV
论文数:
0
引用数:
0
h-index:
0
DAVYDOV, GV
DAVYDOVA, IM
论文数:
0
引用数:
0
h-index:
0
DAVYDOVA, IM
IZVESTIYA VYSSHIKH UCHEBNYKH ZAVEDENII MATEMATIKA,
1988,
(12):
: 59
-
62
[10]
A LINEAR CHARACTERIZATION OF NP-COMPLETE PROBLEMS
URSIC, S
论文数:
0
引用数:
0
h-index:
0
URSIC, S
LECTURE NOTES IN COMPUTER SCIENCE,
1984,
170
: 80
-
100
←
1
2
3
4
5
→