首页
学术期刊
论文检测
AIGC检测
热点
更多
数据
ON THE COMPUTATIONAL-COMPLEXITY OF DISCRETE MULTIVARIATE PROBLEMS
被引:0
|
作者
:
YEMELICHEV, VA
论文数:
0
引用数:
0
h-index:
0
YEMELICHEV, VA
PEREPELITSA, VA
论文数:
0
引用数:
0
h-index:
0
PEREPELITSA, VA
机构
:
来源
:
SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES
|
1988年
/ 26卷
/ 04期
关键词
:
D O I
:
暂无
中图分类号
:
TP301 [理论、方法];
学科分类号
:
081202 ;
摘要
:
引用
收藏
页码:162 / 168
页数:7
相关论文
共 50 条
[1]
COMPUTATIONAL-COMPLEXITY OF PERT PROBLEMS
HAGSTROM, JN
论文数:
0
引用数:
0
h-index:
0
HAGSTROM, JN
NETWORKS,
1988,
18
(02)
: 139
-
147
[2]
CLASSIFYING THE COMPUTATIONAL-COMPLEXITY OF PROBLEMS
STOCKMEYER, L
论文数:
0
引用数:
0
h-index:
0
STOCKMEYER, L
JOURNAL OF SYMBOLIC LOGIC,
1987,
52
(01)
: 1
-
43
[3]
THE COMPUTATIONAL-COMPLEXITY OF DECENTRALIZED DISCRETE-EVENT CONTROL-PROBLEMS
RUDIE, K
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV GRONINGEN,INST MATH,9700 AV GRONINGEN,NETHERLANDS
UNIV GRONINGEN,INST MATH,9700 AV GRONINGEN,NETHERLANDS
RUDIE, K
WILLEMS, JC
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV GRONINGEN,INST MATH,9700 AV GRONINGEN,NETHERLANDS
UNIV GRONINGEN,INST MATH,9700 AV GRONINGEN,NETHERLANDS
WILLEMS, JC
IEEE TRANSACTIONS ON AUTOMATIC CONTROL,
1995,
40
(07)
: 1313
-
1319
[4]
COMPUTATIONAL-COMPLEXITY OF SOME PROBLEMS IN PARAMETRIC DISCRETE PROGRAMMING .1.
BLAIR, CE
论文数:
0
引用数:
0
h-index:
0
机构:
GEORGIA INST TECHNOL,ATLANTA,GA 30332
GEORGIA INST TECHNOL,ATLANTA,GA 30332
BLAIR, CE
JEROSLOW, RG
论文数:
0
引用数:
0
h-index:
0
机构:
GEORGIA INST TECHNOL,ATLANTA,GA 30332
GEORGIA INST TECHNOL,ATLANTA,GA 30332
JEROSLOW, RG
MATHEMATICS OF OPERATIONS RESEARCH,
1986,
11
(02)
: 241
-
260
[5]
ON THE COMPUTATIONAL-COMPLEXITY OF PATH COVER PROBLEMS
NTAFOS, S
论文数:
0
引用数:
0
h-index:
0
机构:
Univ of Texas at Dallas, Computer, Science Program, Richardson, TX, USA, Univ of Texas at Dallas, Computer Science Program, Richardson, TX, USA
NTAFOS, S
GONZALEZ, T
论文数:
0
引用数:
0
h-index:
0
机构:
Univ of Texas at Dallas, Computer, Science Program, Richardson, TX, USA, Univ of Texas at Dallas, Computer Science Program, Richardson, TX, USA
GONZALEZ, T
JOURNAL OF COMPUTER AND SYSTEM SCIENCES,
1984,
29
(02)
: 225
-
242
[6]
ARITHMETIC THEORIES FOR COMPUTATIONAL-COMPLEXITY PROBLEMS
HOMER, S
论文数:
0
引用数:
0
h-index:
0
机构:
HARVARD UNIV, AIKEN COMPUTAT LAB, CAMBRIDGE, MA 02138 USA
HARVARD UNIV, AIKEN COMPUTAT LAB, CAMBRIDGE, MA 02138 USA
HOMER, S
REIF, J
论文数:
0
引用数:
0
h-index:
0
机构:
HARVARD UNIV, AIKEN COMPUTAT LAB, CAMBRIDGE, MA 02138 USA
HARVARD UNIV, AIKEN COMPUTAT LAB, CAMBRIDGE, MA 02138 USA
REIF, J
INFORMATION AND CONTROL,
1986,
69
(1-3):
: 1
-
11
[7]
COMPUTATIONAL-COMPLEXITY OF ART GALLERY PROBLEMS
LEE, DT
论文数:
0
引用数:
0
h-index:
0
机构:
Northwestern Univ, IL, USA, Northwestern Univ, IL, USA
LEE, DT
LIN, AK
论文数:
0
引用数:
0
h-index:
0
机构:
Northwestern Univ, IL, USA, Northwestern Univ, IL, USA
LIN, AK
IEEE TRANSACTIONS ON INFORMATION THEORY,
1986,
32
(02)
: 276
-
282
[8]
A NOTE ON THE COMPUTATIONAL-COMPLEXITY OF BRACKETING AND RELATED PROBLEMS
KRIVANEK, M
论文数:
0
引用数:
0
h-index:
0
KRIVANEK, M
LECTURE NOTES IN COMPUTER SCIENCE,
1989,
381
: 136
-
145
[9]
ON THE COMPUTATIONAL-COMPLEXITY OF THE GENERAL DISCRETE FOURIER-TRANSFORM
BETH, T
论文数:
0
引用数:
0
h-index:
0
BETH, T
THEORETICAL COMPUTER SCIENCE,
1987,
51
(03)
: 331
-
339
[10]
AN AXIOMATIC APPROACH TO LOWER BOUND PROBLEMS IN COMPUTATIONAL-COMPLEXITY
BELAGA, EG
论文数:
0
引用数:
0
h-index:
0
BELAGA, EG
JOURNAL OF SYMBOLIC LOGIC,
1987,
52
(01)
: 307
-
307
←
1
2
3
4
5
→