On sets of linear forms of maximal complexity
From MaRDI portal
Publication:2680709
DOI10.1007/s00037-022-00234-5OpenAlexW3205869162MaRDI QIDQ2680709
Publication date: 4 January 2023
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.04657
Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Polynomials in number theory (11C08) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An effective version of the Lindemann-Weierstrass theorem for interpolation determinants
- Elimination of constants from machines over algebraically closed fields
- Sharp estimates for the arithmetic Nullstellensatz
- Integral points of small height outside of a hypersurface
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- An Algorithm for the Computation of Linear Forms
- Polynomials with Rational Coefficients Which are Hard to Compute
- Sets of Linear Forms Which Are Hard to Compute