HEAL DSpace

On the average complexity for the verification of compatible sequences

Αποθετήριο DSpace/Manakin

Εμφάνιση απλής εγγραφής

dc.contributor.author Koukouvinos, C en
dc.contributor.author Pillwein, V en
dc.contributor.author Simos, DE en
dc.contributor.author Zafeirakopoulos, Z en
dc.date.accessioned 2014-03-01T01:36:33Z
dc.date.available 2014-03-01T01:36:33Z
dc.date.issued 2011 en
dc.identifier.issn 0020-0190 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/21332
dc.subject Algorithms en
dc.subject Average-case analysis en
dc.subject Complexity en
dc.subject Non-periodic autocorrelation function en
dc.subject Periodic autocorrelation function en
dc.subject Sequences en
dc.subject Symbolic computation en
dc.subject.classification Computer Science, Information Systems en
dc.subject.other Autocorrelation functions en
dc.subject.other Average-case analysis en
dc.subject.other Complexity en
dc.subject.other Periodic autocorrelation functions en
dc.subject.other Sequences en
dc.subject.other Symbolic computation en
dc.subject.other Asymptotic analysis en
dc.subject.other Autocorrelation en
dc.subject.other Regression analysis en
dc.title On the average complexity for the verification of compatible sequences en
heal.type journalArticle en
heal.identifier.primary 10.1016/j.ipl.2011.05.015 en
heal.identifier.secondary http://dx.doi.org/10.1016/j.ipl.2011.05.015 en
heal.language English en
heal.publicationDate 2011 en
heal.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(n root n log n) for sequences of length n. (C) 2011 Elsevier B.V. All rights reserved. en
heal.publisher ELSEVIER SCIENCE BV en
heal.journalName Information Processing Letters en
dc.identifier.doi 10.1016/j.ipl.2011.05.015 en
dc.identifier.isi ISI:000293366400001 en
dc.identifier.volume 111 en
dc.identifier.issue 17 en
dc.identifier.spage 825 en
dc.identifier.epage 830 en


Αρχεία σε αυτό το τεκμήριο

Αρχεία Μέγεθος Μορφότυπο Προβολή

Δεν υπάρχουν αρχεία που σχετίζονται με αυτό το τεκμήριο.

Αυτό το τεκμήριο εμφανίζεται στην ακόλουθη συλλογή(ές)

Εμφάνιση απλής εγγραφής