Polynomials with two values
From MaRDI portal
The authors investigate the minimal degree of polynomials \(f\in\mathbb R[x]\) that take only two values on the set of integers \(\{0,\dots,n\}\). The authors give applications to Boolean functions.
Recommendations
- A class of polynomials in two variables
- scientific article; zbMATH DE number 5054171
- Propriétés multiplicatives des valeurs de certains polynômes en deux variables
- scientific article; zbMATH DE number 7236678
- Polynomials with multiple zeros
- Polynomials with two nonzero coefficients and high multiplicity at 1
- A two-variable interlace polynomial
- scientific article; zbMATH DE number 857692
Cites work
Cited in
(24)- Results on rotation symmetric bent functions
- On the degree of Boolean functions as real polynomials
- Symmetric random function generator (SRFG): a novel cryptographic primitive for designing fast and robust algorithms
- A variation on bisecting the binomial coefficients
- Complexity measures and decision tree complexity: a survey.
- Learning functions of \(k\) relevant variables
- On separation between the degree of a Boolean function and the block sensitivity
- Bisecting binomial coefficients
- Junta threshold for low degree Boolean functions on the slice
- Exact quantum query complexity of \(\mathrm{EXACT}_{k,l}^n\)
- Enhanced count of balanced symmetric functions and balanced alternating functions
- Hamming weights of symmetric Boolean functions
- Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications
- On the minimal Fourier degree of symmetric Boolean functions
- Asymptotic behavior of perturbations of symmetric functions
- Optimal polynomial-time compression for Boolean Max CSP
- On the degree of univariate polynomials over the integers
- Sparse juntas on the biased hypercube
- On the degree of Boolean functions as polynomials over \(\mathbb{Z}_m\)
- Low-bandwidth mixed arithmetic in VOLE-based ZK from low-degree PRGs
- Decision tree complexity versus block sensitivity and degree
- Optimal polynomial-time compression for Boolean Max CSP
- A divisibility approach to the open boundary cases of Cusick-Li-Stǎnicǎ's conjecture
- On the Fourier spectrum of symmetric Boolean functions
This page was built for publication: Polynomials with two values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1276272)
