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 条

[41] A HYBRID OF QUICKSORT WITH O(N LOG N) WORST CASE COMPLEXITY
ROHRICH, J
INFORMATION PROCESSING LETTERS, 1982, 14 (03) : 119 - 123
[42] An O (n(log n)2/log log n) algorithm for the single maximum coverage location or the (1, Xp)-medianoid problem on trees
Spoerhase, J.
Wirth, H. -C.
INFORMATION PROCESSING LETTERS, 2009, 109 (08) : 391 - 394
[43] LOG N-LOG S IS INCONCLUSIVE
KLEBESADEL, RW
FENIMORE, EE
LAROS, JG
AIP CONFERENCE PROCEEDINGS, 1984, (115) : 429 - 433
[44] Expected Linear Time Sorting for Word Size Ω(log2 n log log n)
Belazzougui, Djamal
Brodal, Gerth Stolting
Nielsen, Jesper Sindahl
ALGORITHM THEORY - SWAT 2014, 2014, 8503 : 26 - +
[45] AN O(N-LOG LOG-N)-TIME ALGORITHM FOR TRIANGULATING A SIMPLE POLYGON
TARJAN, RE
VANWYK, CJ
SIAM JOURNAL ON COMPUTING, 1988, 17 (01) : 143 - 178
[46] A O(n log2 n) Checker and O(n2 log n) Filtering Algorithm for the Energetic Reasoning
Ouellet, Yanick
Quimper, Claude-Guy
INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, CPAIOR 2018, 2018, 10848 : 477 - 494
[47] AN O(N(LOG LOG N)) LEARNING ALGORITHM FOR DNF UNDER THE UNIFORM-DISTRIBUTION
MANSOUR, Y
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 50 (03) : 543 - 550
[48] Finding neighbours on bincode-based images in O(n log log n) time
Chung, KL
Huang, CY
PATTERN RECOGNITION LETTERS, 1996, 17 (10) : 1117 - 1124
[49] O(N log N) multilevel calculation of N eigenfunctions
Livine, OE
Brandt, A
MULTISCALE COMPUTATIONAL METHODS IN CHEMISTRY AND PHYSICS, 2001, 177 : 112 - 136
[50] λ-OAT:: λ-geometry obstacle-avoiding tree construction with o (n log n) complexity
Jing, Tom Tong
Feng, Zhe
Hu, Yu
Hong, Xianlong L.
Hu, Xiaodong D.
Yan, Guiying Y.
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2007, 26 (11) : 2073 - 2079

← 1 2 3 4 5 →