On the degree of univariate polynomials over the integers
From MaRDI portal
Publication:5916007
DOI10.1007/s00493-015-2987-0zbMath1399.11080OpenAlexW2564346659MaRDI QIDQ5916007
Gil Cohen, Amir Shpilka, Avishay Tal
Publication date: 12 April 2018
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-015-2987-0
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On the minimal Fourier degree of symmetric Boolean functions
- On the Fourier spectrum of symmetric Boolean functions
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Determinants and their applications in mathematical physics
- Polynomials with two values
- Complexity measures and decision tree complexity: a survey.
- Learning functions of \(k\) relevant variables
- The Difference Between Consecutive Primes, II
- Constant depth circuits, Fourier transform, and learnability
- A Remark on Stirling's Formula
- On the order of magnitude of the difference between consecutive prime numbers
- Computational Complexity
This page was built for publication: On the degree of univariate polynomials over the integers
