首页
学术期刊
论文检测
AIGC检测
热点
更多
数据
SOME NEGATIVE RESULTS ON THE COMPUTATIONAL-COMPLEXITY OF TOTAL VARIATION AND DIFFERENTIATION
被引:0
|
作者
:
KO, KI
论文数:
0
|
引用数:
0
|
h-index:
0
|
KO, KI
机构
:
来源
:
INFORMATION AND CONTROL
|
1982年
/ 53卷
/ 1-2期
关键词
:
D O I
:
暂无
中图分类号
:
TP301 [理论、方法];
学科分类号
:
081202 ;
摘要
:
引用
收藏
页码:21 / 31
页数:11
相关论文
相似文献
共 50 条
[31]
ESTIMATION OF THE GRADIENT COMPUTATIONAL-COMPLEXITY
KIM, KV
论文数:
0
|
引用数:
0
|
h-index:
0
|
KIM, KV
NESTEROV, IE
论文数:
0
|
引用数:
0
|
h-index:
0
|
NESTEROV, IE
CHERKASSKII, BV
论文数:
0
|
引用数:
0
|
h-index:
0
|
CHERKASSKII, BV
DOKLADY AKADEMII NAUK SSSR,
1984,
275
(06):
: 1306
-
1309
[32]
COMPUTATIONAL-COMPLEXITY OF REAL FUNCTIONS
KO, KI
论文数:
0
|
引用数:
0
|
h-index:
0
|
机构:
OHIO STATE UNIV,DEPT MATH,COLUMBUS,OH 43210
OHIO STATE UNIV,DEPT MATH,COLUMBUS,OH 43210
KO, KI
FRIEDMAN, H
论文数:
0
|
引用数:
0
|
h-index:
0
|
机构:
OHIO STATE UNIV,DEPT MATH,COLUMBUS,OH 43210
OHIO STATE UNIV,DEPT MATH,COLUMBUS,OH 43210
FRIEDMAN, H
THEORETICAL COMPUTER SCIENCE,
1982,
20
(03)
: 323
-
352
[33]
THE COMPUTATIONAL-COMPLEXITY OF MAXIMIZATION AND INTEGRATION
FRIEDMAN, H
论文数:
0
|
引用数:
0
|
h-index:
0
|
FRIEDMAN, H
ADVANCES IN MATHEMATICS,
1984,
53
(01)
: 80
-
98
[34]
THE COMPUTATIONAL-COMPLEXITY OF CELLULAR AUTOMATA
SUTNER, K
论文数:
0
|
引用数:
0
|
h-index:
0
|
SUTNER, K
LECTURE NOTES IN COMPUTER SCIENCE,
1989,
380
: 451
-
459
[35]
ON THE COMPUTATIONAL-COMPLEXITY OF CODES IN GRAPHS
KRATOCHVIL, J
论文数:
0
|
引用数:
0
|
h-index:
0
|
KRATOCHVIL, J
KRIVANEK, M
论文数:
0
|
引用数:
0
|
h-index:
0
|
KRIVANEK, M
LECTURE NOTES IN COMPUTER SCIENCE,
1988,
324
: 396
-
404
[36]
COMPUTATIONAL-COMPLEXITY OF SPLINE INTERPOLATION
TORAICHI, K
论文数:
0
|
引用数:
0
|
h-index:
0
|
机构:
UNIV TSUKUBA,DOCTORAL PROGRAM ENGN,SAKURA,IBARAKI 305,JAPAN
UNIV TSUKUBA,DOCTORAL PROGRAM ENGN,SAKURA,IBARAKI 305,JAPAN
TORAICHI, K
KATAGISHI, K
论文数:
0
|
引用数:
0
|
h-index:
0
|
机构:
UNIV TSUKUBA,DOCTORAL PROGRAM ENGN,SAKURA,IBARAKI 305,JAPAN
UNIV TSUKUBA,DOCTORAL PROGRAM ENGN,SAKURA,IBARAKI 305,JAPAN
KATAGISHI, K
SEKITA, I
论文数:
0
|
引用数:
0
|
h-index:
0
|
机构:
UNIV TSUKUBA,DOCTORAL PROGRAM ENGN,SAKURA,IBARAKI 305,JAPAN
UNIV TSUKUBA,DOCTORAL PROGRAM ENGN,SAKURA,IBARAKI 305,JAPAN
SEKITA, I
MORI, R
论文数:
0
|
引用数:
0
|
h-index:
0
|
机构:
UNIV TSUKUBA,DOCTORAL PROGRAM ENGN,SAKURA,IBARAKI 305,JAPAN
UNIV TSUKUBA,DOCTORAL PROGRAM ENGN,SAKURA,IBARAKI 305,JAPAN
MORI, R
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE,
1987,
18
(05)
: 945
-
954
[37]
ON THE COMPUTATIONAL-COMPLEXITY OF THE ORDER POLYNOMIAL
FAIGLE, U
论文数:
0
|
引用数:
0
|
h-index:
0
|
FAIGLE, U
SCHRADER, R
论文数:
0
|
引用数:
0
|
h-index:
0
|
SCHRADER, R
DISCRETE APPLIED MATHEMATICS,
1986,
15
(2-3)
: 261
-
269
[38]
COMPUTATIONAL-COMPLEXITY OF SOME MAXIMUM AVERAGE WEIGHT PROBLEMS WITH PRECEDENCE CONSTRAINTS
FAIGLE, U
论文数:
0
|
引用数:
0
|
h-index:
0
|
机构:
Univ of Twente, Enschede
FAIGLE, U
KERN, W
论文数:
0
|
引用数:
0
|
h-index:
0
|
机构:
Univ of Twente, Enschede
KERN, W
OPERATIONS RESEARCH,
1994,
42
(04)
: 688
-
693
[39]
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
[40]
COMPUTATIONAL-COMPLEXITY OF OPTIMUM MULTIUSER DETECTION
VERDU, S
论文数:
0
|
引用数:
0
|
h-index:
0
|
VERDU, S
ALGORITHMICA,
1989,
4
(03)
: 303
-
312
←
1
2
3
4
5
→