Solving systems of algebraic equations

DOI10.1145/569746.569750zbMath1054.65053OpenAlexW2047295759WikidataQ56518858 ScholiaQ56518858MaRDI QIDQ4810184

Daniel Lazard

Publication date: 1 September 2004

Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/569746.569750

zbMATH Keywords

complexityalgorithmmultivariate polynomialsalgebraic methodsset of zeros

Mathematics Subject Classification ID

Related Items (3)

A geometric view of cryptographic equation solving ⋮ Random arithmetic formulas can be reconstructed efficiently ⋮ Average-case linear matrix factorization and reconstruction of low width algebraic branching programs

This page was built for publication: Solving systems of algebraic equations