On the degree of Boolean functions as polynomials over Z_m
From MaRDI portal
Publication:6842471
Cites work
- <tex>$p$</tex>-Adic Valuation of Weights in Abelian Codes Over<tex>$BBZ_p^d$</tex>
- 3-query locally decodable codes of subexponential length
- A lemma on polynomials modulo \(p^m\) and applications to coding theory
- A tight ω(loglog n)-bound on the time for parallel RAM's to compute nondegenerated boolean functions
- An asymptotically tight bound on the number of relevant variables in a bounded degree Boolean function
- An equivalence of Ward's bound and its application
- An Interpolation Series for Continuous Functions of a p-adic Variable.
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- Complexity measures and decision tree complexity: a survey.
- Constant depth circuits, Fourier transform, and learnability
- Constructing Ramsey graphs from Boolean function representations
- Constructing set systems with prescribed intersection sizes
- scientific article; zbMATH DE number 5605137 (Why is no real title available?)
- scientific article; zbMATH DE number 5568623 (Why is no real title available?)
- scientific article; zbMATH DE number 3314813 (Why is no real title available?)
- Learning Decision Trees Using the Fourier Spectrum
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
- Learning juntas
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- On the degree of Boolean functions as real polynomials
- On the modulo degree complexity of Boolean functions
- Polynomials with two values
- Quantum communication complexity of symmetric predicates
- Representing Boolean functions as polynomials modulo composite numbers
- Strong direct product theorems for quantum communication and query complexity
- Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
- The difference between consecutive primes. II
- Uniqueness Theorems for Periodic Functions
- Weights modulo p^e of linear codes over rings
This page was built for publication: On the degree of Boolean functions as polynomials over \(\mathbb{Z}_m\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842471)
