On the average complexity for the verification of compatible sequences (Q1944143): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Christos Koukouvinos / rank
Normal rank
 
Property / author
 
Property / author: Dimitris E. Simos / rank
Normal rank
 
Property / author
 
Property / author: Christos Koukouvinos / rank
 
Normal rank
Property / author
 
Property / author: Dimitris E. Simos / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: HolonomicFunctions / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Asymptotics / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2011.05.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975309265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Zeilberger's fast algorithm to general holonomic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of ternary complementary pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3580296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed differences for weighing designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4876979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function---a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3104028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving systems of strict polynomial inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On supplementary difference sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resurrecting the asymptotics of linear recurrences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A holonomic systems approach to special functions identities / rank
 
Normal rank

Latest revision as of 08:40, 6 July 2024

scientific article
Language Label Description Also known as
English
On the average complexity for the verification of compatible sequences
scientific article

    Statements

    On the average complexity for the verification of compatible sequences (English)
    0 references
    0 references
    0 references
    0 references
    4 April 2013
    0 references
    0 references
    sequences
    0 references
    periodic autocorrelation function
    0 references
    non-periodic autocorrelation function
    0 references
    complexity
    0 references
    average-case analysis
    0 references
    symbolic computation
    0 references
    0 references