An improvement of the complexity bound for solving systems of polynomial equations

DOI10.1007/s10958-012-0724-4zbMath1322.12003OpenAlexW2023307326MaRDI QIDQ1762547

Alexander L. Chistov

Publication date: 27 November 2012

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-012-0724-4

zbMATH Keywords

systems of polynomial equationsbounds on complexitydegrees and lengths of coefficients

Mathematics Subject Classification ID

Related Items (3)

An effective algorithm for deciding the solvability of a system of polynomial equations over 𝑝-adic integers ⋮ On probabilistic algorithm for solving almost all instances of the set partition problem ⋮ On the family of cubical multivariate cryptosystems based on the algebraic graph over finite commutative rings of characteristic 2

Uses Software

• LAPACK

Cites Work

• Efficient smooth stratification of an algebraic variety in zero characteristic and its applications
• Unnamed Item
• Unnamed Item

This page was built for publication: An improvement of the complexity bound for solving systems of polynomial equations