On the average complexity for the verification of compatible sequences
From MaRDI portal
Publication:1944143
DOI10.1016/j.ipl.2011.05.015zbMath1260.68496OpenAlexW1975309265MaRDI QIDQ1944143
Zafeirakis Zafeirakopoulos, Veronika Pillwein, Dimitris E. Simos, Christos Koukouvinos
Publication date: 4 April 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.05.015
complexitysequencessymbolic computationaverage-case analysisperiodic autocorrelation functionnon-periodic autocorrelation function
Uses Software
Cites Work
- Signed differences for weighing designs
- Resurrecting the asymptotics of linear recurrences
- New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function---a review
- A holonomic systems approach to special functions identities
- Solving systems of strict polynomial inequalities
- An extension of Zeilberger's fast algorithm to general holonomic functions
- On supplementary difference sets
- A theory of ternary complementary pairs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the average complexity for the verification of compatible sequences