On the complexity of a family related to the Legendre symbol

DOI10.1007/s10998-009-10209-4zbMath1199.11103OpenAlexW2015229802MaRDI QIDQ1046886

Katalin Gyarmati

Publication date: 29 December 2009

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10998-009-10209-4

zbMATH Keywords

pseudorandom\(f\)-complexity

Mathematics Subject Classification ID

Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (5)

Family complexity and cross-correlation measure for families of binary sequences ⋮ MULTIPLICATIVE CHARACTER SUMS OF A CLASS OF NONLINEAR RECURRENCE VECTOR SEQUENCES ⋮ On pseudorandomness of families of binary sequences ⋮ Family Complexity and VC-Dimension ⋮ On the complexity of a family of Legendre sequences with irreducible polynomials

Cites Work

• A complexity measure for families of binary sequences
• Construction of large families of pseudorandom binary sequences
• Unnamed Item

This page was built for publication: On the complexity of a family related to the Legendre symbol