REFINED BOUNDS ON THE COMPLEXITY OF SORTING AND SELECTION IN D - DIMENSIONAL SPACE

被引：0

|

作者：

FISCHER, TM

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1986年 / 233卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：308 / 314

页数：7

相关论文

共 50 条

[1] Bounds on complexity when sorting reals
Jiřina M.
Jiřina, Marcel, 1600, North Atlantic University Union, 942 Windemere Dr. NW.,, Salem, Oregon 97304, United States (14): : 276 - 281
[2] TIGHT BOUNDS ON THE COMPLEXITY OF PARALLEL SORTING
LEIGHTON, T
IEEE TRANSACTIONS ON COMPUTERS, 1985, 34 (04) : 344 - 354
[3] TIGHT COMPARISON BOUNDS ON THE COMPLEXITY OF PARALLEL SORTING
AZAR, Y
VISHKIN, U
SIAM JOURNAL ON COMPUTING, 1987, 16 (03) : 458 - 464
[4] UPPER-BOUNDS FOR TIME-SPACE TRADE-OFFS IN SORTING AND SELECTION
FREDERICKSON, GN
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1987, 34 (01) : 19 - 26
[5] Refined Bounds on Kolmogorov Complexity for omega-Languages
Mielke, Joeran
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2008, 221 (181-189) : 181 - 189
[6] RELATING REFINED SPACE COMPLEXITY CLASSES
SEIFERAS, JI
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1977, 14 (01) : 100 - 129
[7] ON THE INHERENT COMBINATORIAL COMPLEXITY OF GEOMETRIC PROBLEMS IN D - DIMENSIONAL SPACE
FISCHER, TM
WOLFRUM, K
LECTURE NOTES IN COMPUTER SCIENCE, 1986, 233 : 315 - 324
[8] Refined Rademacher Chaos Complexity Bounds with Applications to the Multikernel Learning Problem
Lei, Yunwen
Ding, Lixin
NEURAL COMPUTATION, 2014, 26 (04) : 739 - 760
[9] Refined Bounds on Shannon's Function for Complexity of Circuits of Functional Elements
Lozhkin, S. A.
MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2022, 77 (03) : 144 - 153
[10] Refined Bounds on Shannon’s Function for Complexity of Circuits of Functional Elements
S. A. Lozhkin
Moscow University Mathematics Bulletin, 2022, 77 : 144 - 153

← 1 2 3 4 5 →