Generalized exponential sums and the power of computers
From MaRDI portal
Publication:2398949
DOI10.2140/involve.2018.11.127zbMath1420.11144OpenAlexW2740005764WikidataQ115497266 ScholiaQ115497266MaRDI QIDQ2398949
Oscar E. González, Luis A. Medina, Francis N. Castro
Publication date: 21 August 2017
Published in: Involve (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/involve.2018.11.127
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Asymptotic behavior of perturbations of symmetric functions
- A divisibility approach to the open boundary cases of Cusick-Li-Stǎnicǎ's conjecture
- A fast algorithm for proving terminating hypergeometric identities
- Enumerating Boolean functions of cryptographic significance
- A holonomic systems approach to special functions identities
- Recurrences for sums of powers of binomial coefficients
- \(k\)th order symmetric SAC Boolean functions and bisecting binomial coefficients
- Recent Results on Balanced Symmetric Boolean Functions
- A Note on a Conjecture for Balanced Elementary Symmetric Boolean Functions
- Symmetric Boolean Functions
- On a conjecture for balanced symmetric Boolean functions
- Balanced Symmetric Functions Over ${\hbox{GF}}(p)$
- $p$-adic estimates for exponential sums and the theorem of Chevalley-Warning
- On the correlation of symmetric functions
- The Degree of Balanced Elementary Symmetric Boolean Functions of <formula formulatype="inline"> <tex Notation="TeX">${{\bf 4k}+{\bf 3}}$</tex> </formula> Variables
This page was built for publication: Generalized exponential sums and the power of computers