On sets of linear forms of maximal complexity

DOI10.1007/S00037-022-00234-5MaRDI QIDQ2680709zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 4 January 2023

Published in Computational Complexity (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2110.04657

zbMATH Keywords

additive complexitycommon nonzeros of polynomialseffective Perron theoremlinear algorithms

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Sets of Linear Forms Which Are Hard to Compute
• scientific article; zbMATH DE number 2070405
• The complexity of linear problems in fields
• Complexity of the satisfiability problem for multilinear forms over a finite field
• General systems of linear forms: equidistribution and true complexity
• The complexity of solution-free sets of integers for general linear equations
• scientific article; zbMATH DE number 6004867
• Complexity of a class of nonlinear combinatorial problems related to their linear counterparts
• On the Descriptive Complexity of Linear Algebra
• On the complexity of realization of the linear function by formulas over finite Boolean bases

Cites work

• Algebraic dependence of polynomials after O. Perron and some applications
• An Algorithm for the Computation of Linear Forms
• An effective version of the Lindemann-Weierstrass theorem for interpolation determinants
• Elimination of constants from machines over algebraically closed fields
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 3759547 (Why is no real title available?)
• scientific article; zbMATH DE number 52177 (Why is no real title available?)
• scientific article; zbMATH DE number 3461412 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• Integral points of small height outside of a hypersurface
• Polynomials with Rational Coefficients Which are Hard to Compute
• Sets of Linear Forms Which Are Hard to Compute
• Sharp estimates for the arithmetic Nullstellensatz

Cited in

(6)

• On the teaching complexity of linear sets
• On the Teaching Complexity of Linear Sets
• scientific article; zbMATH DE number 6004867 (Why is no real title available?)
• Sets of Linear Forms Which Are Hard to Compute
• On sets of linear forms of maximal complexity
• Complexity of the satisfiability problem for multilinear forms over a finite field

This page was built for publication: On sets of linear forms of maximal complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680709)