A Deterministic Construction of Normal Bases With Complexity O(n3 + n log n log(log n) log q)

被引：0

|

作者：

Poli, A.

机构：

来源：

Journal of Symbolic Computation | / 19卷 / 04期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[21] OPTIMAL PARALLEL SELECTION HAS COMPLEXITY O (LOG LOG N)
AJTAI, M
KOMLOS, J
STEIGER, WL
SZEMEREDI, E
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1989, 38 (01) : 125 - 133
[22] IF DETERMINISTIC AND NONDETERMINISTIC SPACE COMPLEXITIES ARE EQUAL FOR LOG LOG-N, THEN THEY ARE ALSO EQUAL FOR LOG-N
SZEPIETOWSKI, A
THEORETICAL COMPUTER SCIENCE, 1990, 74 (01) : 115 - 119
[23] Denser packings obtained in O(n log log n) tTime
Pisinger, David
INFORMS JOURNAL ON COMPUTING, 2007, 19 (03) : 395 - 405
[24] THERE ARE NO FULLY SPACE CONSTRUCTIBLE FUNCTIONS BETWEEN LOG LOG N AND LOG N
SZEPIETOWSKI, A
INFORMATION PROCESSING LETTERS, 1987, 24 (06) : 361 - 362
[25] Implicit dictionaries supporting searches and amortized updates in O (log n log log n) time
Franceschini, G
Grossi, R
PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 670 - 678
[26] Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time
Huang, Shang-En
Huang, Dawei
Kopelowitz, Tsvi
Pettie, Seth
PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 510 - 520
[27] Shortest Paths in Planar Graphs with Real Lengths in O(n log2 n/log log n) Time
Mozes, Shay
Wulff-Nilsen, Christian
ALGORITHMS-ESA 2010, PT II, 2010, 6347 : 206 - +
[28] AN O(N LOG N + M LOG LOG N) MAXIMUM WEIGHT CLIQUE ALGORITHM FOR CIRCULAR-ARC GRAPHS
SHIH, WK
HSU, WL
INFORMATION PROCESSING LETTERS, 1989, 31 (03) : 129 - 134
[29] Collaborative Broadcast in O(log log n) Rounds
Schindelhauer, Christian
Oak, Aditya
Janson, Thomas
ALGORITHMS FOR SENSOR SYSTEMS, ALGOSENSORS 2019, 2019, 11931 : 119 - 136
[30] BOUNDED ORDERED DICTIONARIES IN O(LOG LOG N) TIME AND O(N) SPACE
MEHLHORN, K
NAHER, S
INFORMATION PROCESSING LETTERS, 1990, 35 (04) : 183 - 189

← 1 2 3 4 5 →