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 条

[1] A DETERMINISTIC CONSTRUCTION OF NORMAL BASES WITH COMPLEXITY O(N(3)+N LOG-N LOG(LOG-N) LOG-Q)
POLI, A
JOURNAL OF SYMBOLIC COMPUTATION, 1995, 19 (04) : 305 - 319
[2] An O(n3(log log n/log n)5/4) time algorithm for all pairs shortest paths
Han, Yijie
ALGORITHMS - ESA 2006, PROCEEDINGS, 2006, 4168 : 411 - 417
[3] An O(n3 log log n/log n) time algorithm for the all-pairs shortest path problem
Takaoka, T
INFORMATION PROCESSING LETTERS, 2005, 96 (05) : 155 - 161
[4] An O(n3(log log n/log n)5/4) time algorithm for all pairs shortest path
Han, Yijie
ALGORITHMICA, 2008, 51 (04) : 428 - 434
[5] An O(n3(log log n/log n)5/4) Time Algorithm for All Pairs Shortest Path
Yijie Han
Algorithmica, 2008, 51 : 428 - 434
[6] Deterministic sorting in O (n log log n) time and linear space
Han, YJ
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2004, 50 (01): : 96 - 105
[7] Tree Evaluation Is in Space O(log n• log log n)
Cook, James
Mertz, Ian
PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 1268 - 1278
[8] RUSPACE(log n) ⊆ DSPACE(log2 n/log log n)
Allender, E.
Lange, K.-J.
1998, Springer Science and Business Media, LLC (31)
[9] RUSPACE(log n) ⊆ DSPACE(log2 n log log n)
Allender, E
Lange, KJ
THEORY OF COMPUTING SYSTEMS, 1998, 31 (05) : 539 - 550
[10] StUSPACE(log n) ⊆ DSPACE(log2 n/log log n)
Allender, E
Lange, KJ
ALGORITHMS AND COMPUTATION, 1996, 1178 : 193 - 202

← 1 2 3 4 5 →