Generalized exponential sums and the power of computers
From MaRDI portal
Publication:2398949
Recommendations
Cites work
- scientific article; zbMATH DE number 3485662 (Why is no real title available?)
- $p$-adic estimates for exponential sums and the theorem of Chevalley-Warning
- A Note on a Conjecture for Balanced Elementary Symmetric Boolean Functions
- A divisibility approach to the open boundary cases of Cusick-Li-Stǎnicǎ's conjecture
- A fast algorithm for proving terminating hypergeometric identities
- A holonomic systems approach to special functions identities
- Asymptotic behavior of perturbations of symmetric functions
- Balanced Symmetric Functions Over ${\hbox{GF}}(p)$
- Enumerating Boolean functions of cryptographic significance
- On a conjecture for balanced symmetric Boolean functions
- On the correlation of symmetric functions
- Recent Results on Balanced Symmetric Boolean Functions
- Recurrences for sums of powers of binomial coefficients
- Symmetric Boolean Functions
- The Degree of Balanced Elementary Symmetric Boolean Functions of <formula formulatype="inline"> <tex Notation="TeX">${{\bf 4k}+{\bf 3}}$</tex> </formula> Variables
- \(k\)th order symmetric SAC Boolean functions and bisecting binomial coefficients
This page was built for publication: Generalized exponential sums and the power of computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2398949)