On the degree of univariate polynomials over the integers
From MaRDI portal
Publication:5890926
DOI10.1145/2090236.2090269zbMath1348.11024OpenAlexW1971222763MaRDI QIDQ5890926
Amir Shpilka, Avishay Tal, Gil Cohen
Publication date: 7 October 2016
Published in: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2090236.2090269
Combinatorics in computer science (68R05) Polynomials in number theory (11C08) Special sequences and polynomials (11B83) Linear Diophantine equations (11D04)
Related Items
Cites Work
- The reproducible properties of correct forecasts
- The dimensions of individual strings and sequences
- Effective Strong Dimension in Algorithmic Information and Computational Complexity
- The Complexity of Forecast Testing
- The Well-Calibrated Bayesian
- Asymptotic calibration
- Dimension in Complexity Classes
- Universal prediction
- THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES
- Unnamed Item