Name
Abstract | ||
|---|---|---|
The average complexity analysis for a formalism pertaining pairs of compatible sequences is presented. The analysis is done in two levels, so that an accurate estimate is achieved. The way of separating the candidate pairs into suitable classes of ternary sequences is interesting, allowing the use of fundamental tools of symbolic computation, such as holonomic functions and asymptotic analysis to derive an average complexity of O(nnlogn) for sequences of length n. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.ipl.2011.05.015 | Information Processing Letters |
Keywords | Field | DocType |
Sequences,Periodic autocorrelation function,Non-periodic autocorrelation function,Complexity,Algorithms,Average-case analysis,Symbolic computation | Discrete mathematics,Asymptotic computational complexity,Combinatorics,Holonomic,Compatibility (mechanics),Symbolic computation,Ternary operation,Complementary sequences,Formalism (philosophy),Asymptotic analysis,Mathematics | Journal |
Volume | Issue | ISSN |
111 | 17 | 0020-0190 |
Citations | PageRank | References |
1 | 0.36 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christos Koukouvinos | 1 | 84 | 34.73 |
| Veronika Pillwein | 2 | 23 | 6.89 |
| Dimitris E. Simos | 3 | 100 | 23.45 |
| Zafeirakis Zafeirakopoulos | 4 | 26 | 5.04 |