On the average complexity for the verification of compatible sequences
type: Item
instance of: scholarly article
title: On the average complexity for the verification of compatible sequences
zbMATH Open document ID: 1260.68496
author: Veronika Pillwein
author: Zafeirakis Zafeirakopoulos
author: Christos Koukouvinos
author: Dimitris Simos
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 6150447
zbMATH Keywords: sequences
zbMATH Keywords: periodic autocorrelation function
zbMATH Keywords: non-periodic autocorrelation function
zbMATH Keywords: complexity
zbMATH Keywords: average-case analysis
zbMATH Keywords: symbolic computation
describes a project that uses: HolonomicFunctions
describes a project that uses: Asymptotics
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.05.015
OpenAlex ID: W1975309265
cites work: An extension of Zeilberger's fast algorithm to general holonomic functions
cites work: Q4079605
cites work: A theory of ternary complementary pairs
cites work: Q3549563
cites work: Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices
cites work: Q3580296
cites work: Signed differences for weighing designs
cites work: Q4349924
cites work: Q4876979
cites work: New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function---a review
cites work: Q3104028
cites work: Q4875364
cites work: Q4869527
cites work: Solving systems of strict polynomial inequalities
cites work: On supplementary difference sets
cites work: Resurrecting the asymptotics of linear recurrences
cites work: A holonomic systems approach to special functions identities
DOI: 10.1016/J.IPL.2011.05.015
description: scientific article; zbMATH DE number 6150447